1 / 31

A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems

A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems. 18th International Parallel and Distributed Processing Symposium (IPDPS'04) – 2004 Rizos Sakellariou Henan Zhao. Outline. Introduction Background Algorithm Experimental Conclusion. Introduction. Main idea Independent sets

race
Download Presentation

A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Hybrid Heuristic for DAGScheduling on HeterogeneousSystems 18th International Parallel and Distributed Processing Symposium (IPDPS'04) – 2004 Rizos Sakellariou Henan Zhao

  2. Outline • Introduction • Background • Algorithm • Experimental • Conclusion

  3. Introduction • Main idea • Independent sets • Scheduling those sets • Hybrid heuristic? • Why is hybrid heuristic better?

  4. Background（1） • DAG（directed acyclic graph） makespan Task Communication cost

  5. Background（2） • List scheduling • Prioritize the tasks by weight ，Which are subsequently assigned in this order to machines. • Upward rank

  6. Background（3） • Good performance heuristics • DLS（Dynamic Level Scheduling） • HEFT（Heterogeneous Earlist Finish Time） • CPOP（Critical Path On a Processor） • FCP（Fastest Critical Path） • LMT（Levelized-Min Time） • 6 methods to computing the weights • Mean value（M） Simple best value（SB） • Median value（ME） • Worst value（W） • Best value（B） • Simple worst value（SW）

  7. Background（4） • APD（Average Percentage Degradation） • is the average of the percentage of degradation of the best makespan by a particular method. • NB（Number of Best solutions） • Is the number of time a particular method to compute the weights was the only one that produced the shortest makespan. • NEB （Number of best solutions Equal with another method）

  8. Background（5）

  9. Background（6）

  10. Background（7） • WPD （Worst Percentage Degradation） • The maximum percentage degradation over all cases.

  11. Algorithm（1） • The heuristic consists three phases： • Ranking • Group creation • EST（Earliest Start time） • Scheduling independent tasks within each group Hybrid heuristic BMCT（Balanced Minimum Completion Time）

  12. Algorithm（2） • Hybrid Heuristic

  13. Algorithm（3） • BMCT • initial allocation • optimization

  14. Algorithm（4） • BMCT

  15. Experimental（1） • NSL（Normalized Scheduling Length） • The ratio of the makespan divided by a fixed cost of the critical path.

  16. Experimental（2）

  17. Experimental（3）

  18. Experimental（4）

  19. Experimental（5） Hyb.BMCT Hyb.minMin

  20. Experimental（6）

  21. Experimental（7） SL：Schedule Length

  22. Conclusion （1） • Two heuristics for task scheduling on heterogeneous machine • DAG scheduling • Independent tasks

  23. Conclusion （2） m0 m1 m2 m0 m1 m2 n0 n0 17 17 29.6 n5 n5 35.2 n1 n4 n4 36.6 n1 47 42.7 47 55.2 56.6 59.6 BMCT optimum

  24. Thank you

  25. Ranking 圖

  26. Group creation

  27. EST is the time that machine j finishes the execution of all tasks of the previous. is the time that all the data needed to execute task i on machine j is available. m0 m1 m2 n0 17

  28. Initial allocation m0 m1 m2 n0 17 m0 m1 m2 2 2 1 1 n0 3 3 17 n1 39 n4 42.7 52 n5 70

  29. BMCT is the finish time of the last task scheduled on machine m. = Average earliest finish time

  30. BMCT Maximal finish time Maximal finish time m0 m1 m2 m0 m1 m2 n0 n0 17 17 n1 n1 39 n4 UC 39 n4 42.7 42.7 n5 52 n5 UC 69 UC 70

  31. BMCT Maximal finish time Maximal finish time m0 m1 m2 m0 m1 m2 n0 n0 17 17 n1 n5 UC 39 n4 n4 36.6 42.7 n1 47 42.7 C 59.6 n5 C 69

More Related