Observations of Heterogonous Earliest Finish Time HEFT Algorithm

Observations of Heterogonous Earliest Finish Time (HEFT) Algorithm Kevin Tzeng

Task Scheduling for Heterogeneous Computing • Similar to R|pmtn|Cmax, but without preemptions and with precedence constraints • NP Complete Problem • HEFT is a Heuristic Algorithm

Formal Model •

Formal Model (cont. ) •

HEFT Algorithm •

Experiment •

Test Run •

Observations (Runtime) Nodes Connectivity 120 160 140 100 120 80 100 60 80 60 40 40 20 20 0 0 5 10 15 20 25 0. 1 0. 2 0. 3 Machines 0. 4 0. 5 0. 6 0. 7 0. 8 0. 9 1 Processor Range 35 22 30 21. 5 21 25 20 20 15 19. 5 10 19 5 18. 5 0 18 2 3 4 5 6 0. 1 0. 2 0. 3 0. 4 0. 5 0. 6 0. 7

Observations (Makespan) Nodes Connectivity 100 90 80 70 60 50 40 30 20 10 0 5 10 15 20 25 0. 1 0. 2 0. 3 Machines 0. 4 0. 5 0. 6 0. 7 0. 8 0. 9 1 Processor Range 70 70 60 60 50 50 40 40 30 30 20 20 10 10 0 0 2 3 4 5 6 0. 1 0. 2 0. 3 0. 4 0. 5 0. 6 0. 7 0. 8 0. 9 1

Analysis

Conclusion and Future Projects • More rigorous statistical techniques • Use similar simulation to compare with other heuristics

Work Cited • Topcuoglu, Haluk, Salim Hariri, and Min-You Wu. "Performance-Effective and Low. Complexity Task Scheduling for Heterogeneous Computing. " IEEE Transactions On Parallel and Distributed Systems 13. 3 (2002): 260 -74. Web. • Rocklin, Matthew. "Mrocklin / Heft. " Git. Hub. N. p. , 14 Feb. 2013. Web. <https: //github. com/mrocklin/heft>.