Energy-Efficient Scheduling for Tasks with Deadline in Virtualized Environments

Algorithm 1

The proposed algorithm for task scheduling problem.

{

 Sort all the tasks in the decreasing order of in a waiting list

 Let

 while the waiting list is not null

   Compute for task

    if   is not null then

     Choose the VM that has the minimum from

     Assign task to VM

     Update the completion date of VM

      if the completion date of VM is bigger than the given threshold then

      Mark VM as non reusable

      end if

    else

      return no solution

 end while

 return the generated schedule

}