Iterative list scheduling for heterogeneous computing

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

65 Scopus Citations
View graph of relations



Original languageEnglish
Pages (from-to)654-664
Journal / PublicationJournal of Parallel and Distributed Computing
Issue number5
Publication statusPublished - May 2005
Externally publishedYes


Optimal scheduling of parallel applications on distributed computing systems represented by directed acyclic graph (DAG) is NP-complete in the general case. List scheduling is a very popular heuristic method for DAG-based scheduling. However, it is more suited to homogenous distributed computing systems. This paper presents an iterative list scheduling algorithm to deal with scheduling on heterogeneous computing systems. The main idea in this iterative scheduling algorithm is to improve the quality of the schedule in an iterative manner using results from previous iterations. The algorithm first uses the heterogeneous earliest-finish-time (HEFT) algorithm to find an initial schedule and iteratively improves it. Hence the algorithm can potentially produce shorter schedule length. The simulation results show that in the majority of the cases, there is significant improvement to the initial schedule. The algorithm is also found to perform best when the tasks to processors ratio is large. © 2005 Elsevier Inc. All rights reserved.

Research Area(s)

  • Heterogeneous computing systems, List scheduling, Randomly generated DAGs, Task scheduling