Comparative Evaluation of the Robustness of DAG Scheduling Heuristics
Résumé
In this paper, we analyze the robustness of 20 static, makespan-centric, DAG scheduling heuristics of the literature. We also study if dynamically changing the order of the tasks on their assigned processor improves the robustness. Based on experimental results we investigate how robustness and makespan are correlated. Finally, the heuristics are experimentally evaluated and ranked according to their performance in terms of both robustness and makespan.