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

Algorithm 2

Pairwise comparison and selection.

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

(2)   let 𝑝_opt be 𝑝₀.

(3)   let 𝑣_opt be 𝑣_𝑝0,0.

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

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

(6)     Compute 𝑆_stay=SUBS(𝑛_𝑖,𝑝_opt,𝑣_opt,𝑝_𝑗,𝑣_{𝑝𝑗,𝑘}) as defined in (8).

(7)     Compute 𝑆_change=SUBS(𝑛_𝑖,𝑝_𝑗,𝑣_{𝑝𝑗,𝑘},𝑝_opt,𝑣_opt) as defined in (8).

(8)     if  𝑆_stay is greater than 𝑆_change  then

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

(10)    end if

(11)   end for

(12)  end for

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

(14) end for