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. Efficient execution of such applications necessitates intelligent distribution of the application components and tasks on a parallel machine, and orchestrating the execution by utilizing task-, data-, pipelined-, and replicated-parallelism. The scheduling problem that encompasses all of these techniques is called pipelined workflow scheduling, and has been widely studied in the last decade. Multiple models and algorithms flourished to tackle various programming paradigms, constraints, machine behaviors or goals. This paper surveys the field by summing up and structuring known results and approaches.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00521712
Contributor : Anne Benoit <>
Submitted on : Tuesday, September 28, 2010 - 2:15:37 PM
Last modification on : Friday, April 20, 2018 - 3:44:24 PM
Long-term archiving on : Thursday, October 25, 2012 - 4:06:44 PM

File

rr-lip-2010-28.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00521712, version 1

Collections

Citation

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

Share

Metrics

Record views

41

Files downloads

103