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

Algorithm 1

EECS heuristic outline.

Input: A DAG 𝐺(𝑁,𝐸) and a set 𝑃 of DVS-enabled processors.

Output: A schedule 𝑆 of 𝐺 onto 𝑃.

(1) Compute the weights of nodes and edges averaged over differen processors.

(2) Compute the bottom-level ranking for each node.

(3) Sort all tasks in the no-ascending order of bottom-level and put them into list 𝐿.

(4) Generate an initial schedule with consideration on makespan-energy tradeoff (by Algorithm 2).

(5) Adjust the schedule for global energy saving. (by Algorithm 3).