Skip to Main content Skip to Navigation
Conference papers

Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing

Sascha Hunold 1 Thomas Rauber 1 Frédéric Suter 2
2 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00329779
Contributor : Frederic Suter <>
Submitted on : Monday, October 13, 2008 - 2:19:44 PM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM
Long-term archiving on: : Monday, June 7, 2010 - 7:31:12 PM

File

wses08.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Sascha Hunold, Thomas Rauber, Frédéric Suter. Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing. 3rd International Workshop on Workflow Systems in e-Science - WSES 2008, May 2008, Lyon, France. pp.669-674, ⟨10.1109/CCGRID.2008.44⟩. ⟨inria-00329779⟩

Share

Metrics

Record views

382

Files downloads

816