zbMATH — the first resource for mathematics

Iterative list scheduling for heterogeneous computing. (English) Zbl 1101.68420
Summary: 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 homogeneous 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 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.

68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
PDF BibTeX Cite
Full Text: DOI