An Efficient Biobjective Heuristic for Scheduling Workflows on Heterogeneous DVS-Enabled Processors

Algorithm 3

Global energy saving.

(1)   for each task 𝑛_𝑖 sorted in 𝐿  do

(2)   let 𝑝_opt be the processor on which 𝑛_𝑖 is currently scheduled.

(3)   let 𝑣_opt be the VSL to which 𝑛_𝑖 is currently assigned.

(4)   for each processor 𝑝_𝑗 in 𝑃  do

(5)    for each voltage 𝑣_{𝑝𝑗,𝑘} in 𝑉  do

(6)     Tentatively reallocate 𝑛_𝑖 onto 𝑝_𝑗 with 𝑣_𝑝𝑗.

(7)     Recompute the makespan.

(8)     Recompute the total energy consumption 𝐸_total as defined in (7).

(9)     if no increase in makespan and the total energy consumption is reduced then

(10)     Assign 𝑝_𝑗, 𝑣_{𝑝𝑗,𝑘} to 𝑝_opt,𝑣_opt, respectively.

(11)     Update the makespan and the total energy consumption.

(12)    end if

(13)   end for

(14)  end for

(15)  Allocate 𝑛_𝑖 on 𝑝_opt with 𝑣_opt.

(16) end for