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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00521712
Contributor : Anne Benoit <>
Submitted on : Thursday, September 15, 2011 - 1:50:17 PM
Last modification on : Saturday, April 21, 2018 - 1:27:19 AM
Long-term archiving on : Sunday, December 4, 2016 - 9:02:14 AM

File

RR-LIP-2010-28-v2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00521712, version 2

Collections

Citation

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

Share

Metrics

Record views

611

Files downloads

665