Comparative Evaluation Of The Robustness Of DAG Scheduling Heuristics

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.

[1]  Jane W.-S. Liu,et al.  Bounds on Scheduling Algorithms for Heterogeneous Comnputing Systems , 1974, IFIP Congress.

[2]  Edward A. Lee,et al.  A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..

[3]  Füsun Özgüner,et al.  Parallelizing Existing Applications in a Distributed Heterogeneous Environment , 1995 .

[4]  Sathiamoorthy Manoharan,et al.  An Assessment of Assignment Schemes for Dependency Graphs , 1995, Parallel Comput..

[5]  Soonhoi Ha,et al.  A Static Scheduling Heuristic for Heterogeneous Processors , 1996, Euro-Par, Vol. II.

[6]  Imtiaz Ahmad,et al.  DPS: dynamic priority scheduling heuristic for heterogeneous computing systems , 1998 .

[7]  Howard Jay Siegel,et al.  Task execution time modeling for heterogeneous computing systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[8]  Arjan J. C. van Gemund,et al.  Fast and effective task scheduling in heterogeneous systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[9]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[10]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[11]  Ladislau Bölöni,et al.  Robust scheduling of metaprograms , 2002 .

[12]  k-Depth Look-Ahead Task Scheduling in Network of Heterogeneous Processors , 2002, ICOIN.

[13]  Yves Robert,et al.  The iso-level scheduling heuristic for heterogeneous processors , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.

[14]  Jan Janecek,et al.  A simple scheduling heuristic for heterogeneous computing environments , 2003, Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings..

[15]  Rizos Sakellariou,et al.  A hybrid heuristic for DAG scheduling on heterogeneous systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[16]  Rizos Sakellariou,et al.  A low-cost rescheduling policy for efficient mapping of workflows on grid systems , 2004, Sci. Program..

[17]  C. Kesselman,et al.  Montage: A Grid Enabled Image Mosaic Service for the National Virtual Observatory , 2004 .

[18]  Jon B. Weissman,et al.  A new metric for robustness with application to job scheduling , 2005, HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005..

[19]  Ken Kennedy,et al.  TaskScheduling Strategies forWorkflow-based Applications inGrids , 2005 .

[20]  Hsin-An Chen On the design of task scheduling in the heterogeneous computing environments , 2005, PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005..

[21]  Anthony A. Maciejewski,et al.  A Stochastic Approach to Measuring the Robustness of Resource Allocations in Distributed Systems , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[22]  Emmanuel Jeannot,et al.  Robust task scheduling in non-deterministic heterogeneous computing systems , 2006, 2006 IEEE International Conference on Cluster Computing.

[23]  Emmanuel Jeannot,et al.  A Comparison of robustness metrics for scheduling DAGs on heterogeneous systems , 2007, 2007 IEEE International Conference on Cluster Computing.