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

Algorithm 2

Sorted queue task.

	Input: TS = {ts1, ts2, …, tsn} ⟶ Tasks set,
	DLS = {dls1, dls2, …, dlsn} ⟶ Deadlines set.
	Output: RQ (Refreshed Queue).
	Shorting all the service request task in ascending order based on their deadlines
(1)	for x = 1 to n then we have to do
(2)	RQ[x] ← DeleteMin (TSx)
(3)	DeleteMin (TSx) will delete the task which contains less dlsx value
(4)	end for loop
	return RQ