This paper considers the Heterogeneous Earliest Finish Time (HEFT) algorithm for scheduling the tasks of an application, represented by a directed acyclic graph, onto a bounded number of heterogeneous machines. We focus on the appropriate selection of the weight for the nodes and edges of the graph, and experiment with a number of different schemes for computing these weights. Our findings indicate that the length of the schedule produced may be affected significantly by the scheme used, and suggest that the mean value based approach used by HEFT may not be a particularly good choice. © Springer-Verlag 2003.
CITATION STYLE
Zhao, H., & Sakellariou, R. (2004). An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 189–194. https://doi.org/10.1007/978-3-540-45209-6_28
Mendeley helps you to discover research relevant for your work.