An Energy-Efficient Strategy and Secure VM Placement Algorithm in Cloud Computing

Algorithm 3

Categorized task.

	Input: TS = {ts1, ts2, …, tsx} ⟶ Tasks set,
	RPTKx = {Lenx, dlsx, MMx, IOx, bx} ⟶ Tasks resource requirements,
	CPU: (CPUU, CPUL), Main memory: (MMU, MML), Deadline: (dlsU, dlsL), I/O: (IOU, IOL), Bandwidth: (bU, bL).
	Output: Four types of tasks categorize (CPU-based, Memory-based, I/O-based and Communication-based).
(1)	PSU ← CPUU/ddlU
(2)	For each task tkx ∈ TS then do
(3)	Cx ← Lenx/dlsx
(4)	← cx/PSU,  ← MMx/MMU
(5)	← IOx/IOU,  ← bx/bU
(6)	zx ← 1/ +  +  +
(7)	= zxX,  = zxX
(8)	= zxX,  = zxX
(9)	Maximum = {, , , }
(10)	tsx ∈ CPU-based if  = Max
(11)	tsx ∈ Memory-based if  = Max
(12)	tsx ∈ I/O-based if  = Max
(13)	tsx ∈ Communication-based if  = Max
(14)	end for loop
(15)	return CPU-based, Memory-based, I/O-based and Communication-based