A Survey of Pipelined Workflow Scheduling: Models and Algorithms - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2011

A Survey of Pipelined Workflow Scheduling: Models and Algorithms

Abstract

A large class of applications need to execute the same workflow on different data sets of identical size. Efficient execution of such applications necessitates intelligent distribution of the application components and tasks on a parallel machine, and the execution can be orchestrated by utilizing task-, data-, pipelined-, and/or replicated-parallelism. The scheduling problem that encompasses all of these techniques is called pipelined workflow scheduling, and it has been widely studied in the last decade. Multiple models and algorithms have flourished to tackle various programming paradigms, constraints, machine behaviors or optimization goals. This paper surveys the field by summing up and structuring known results and approaches.
Fichier principal
Vignette du fichier
RR-LIP-2010-28-v2.pdf (606.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00521712 , version 1 (28-09-2010)
hal-00521712 , version 2 (15-09-2011)

Identifiers

  • HAL Id : hal-00521712 , version 2

Cite

Anne Benoit, Umit V. Catalyurek, Yves Robert, Erik Saule. A Survey of Pipelined Workflow Scheduling: Models and Algorithms. 2011. ⟨hal-00521712v2⟩
371 View
637 Download

Share

Gmail Facebook X LinkedIn More