Please use this identifier to cite or link to this item:
|Title:||Iterative list scheduling for heterogeneous computing|
|Keywords:||Heterogeneous computing systems|
Randomly generated DAGs
|Citation:||Liu, G.Q., Poh, K.L., Xie, M. (2005-05). Iterative list scheduling for heterogeneous computing. Journal of Parallel and Distributed Computing 65 (5) : 654-664. ScholarBank@NUS Repository.|
|Abstract:||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.|
|Source Title:||Journal of Parallel and Distributed Computing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 7, 2018
WEB OF SCIENCETM
checked on Dec 19, 2018
checked on Jan 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.