The Community for Technology Leaders
Cluster Computing and the Grid, IEEE International Symposium on (2008)
May 19, 2008 to May 22, 2008
ISBN: 978-0-7695-3156-4
pp: 669-674
ABSTRACT
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs)of multi-processor tasks (M-tasks). A DAG is a basic model for expressing workflows applications where each node represents a task of the workflow. We present a novel algorithm (DMHEFT) for scheduling dynamically generated DAGs onto a heterogeneous collection of clusters. The scheduling decisions are based on the predicted runtime of an M-task as well as the estimationof the redistribution costs between data-dependent tasks. The algorithm also takes care of unfavorable placements of M-tasks by considering the postponing of ready tasks even if idle processors are available. We evaluate the scheduling algorithm by comparing the resulting makespans to the results obtained by using others cheduling algorithms, such as RePA and MHEFT.
INDEX TERMS
dag scheduling, workflow scheduling, mixed-parallelism, clusters of clusters
CITATION

F. Suter, S. Hunold and T. Rauber, "Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing," 2008 8th International Symposium on Cluster Computing and the Grid (CCGRID '08)(CCGRID), Lyon, 2008, pp. 669-674.
doi:10.1109/CCGRID.2008.44
94 ms
(Ver 3.3 (11022016))