Work

Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing

Year: 2008

Type: conference-paper

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.

Source: IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)

DOI: 10.1109/ccgrid.2008.44

Authors: Sascha Hunold, Thomas Rauber, Frederic Suter

Institutions: University of Bayreuth, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Laboratoire Lorrain de Recherche en Informatique et ses Applications, Université de Lorraine

Language: English

Topic: Distributed and Parallel Computing Systems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2144769737

FWCI: 2.055

Cites: 11

Cited by: 16

Related to: 10