Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing

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.
Fichier principal
Vignette du fichier
wses08.pdf (178.17 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

inria-00329779 , version 1 (13-10-2008)

Identifiers

Cite

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⟩
126 View
385 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More