Scheduling dynamic workflows onto clusters of clusters using postponing

Sascha Hunold, Thomas Rauber, Frédéric Suter

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

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 estimation of 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 other scheduling algorithms, such as RePA and MHEFT.

Original languageEnglish
Title of host publicationProceedings CCGRID 2008 - 8th IEEE International Symposium on Cluster Computing and the Grid
Pages669-674
Number of pages6
DOIs
StatePublished - 2008
Externally publishedYes
EventCCGRID 2008 - 8th IEEE International Symposium on Cluster Computing and the Grid - Lyon, France
Duration: May 19 2008May 22 2008

Publication series

NameProceedings CCGRID 2008 - 8th IEEE International Symposium on Cluster Computing and the Grid

Conference

ConferenceCCGRID 2008 - 8th IEEE International Symposium on Cluster Computing and the Grid
Country/TerritoryFrance
CityLyon
Period05/19/0805/22/08

Fingerprint

Dive into the research topics of 'Scheduling dynamic workflows onto clusters of clusters using postponing'. Together they form a unique fingerprint.

Cite this