Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-00926178
Contributor : Equipe Roma <>
Submitted on : Thursday, January 9, 2014 - 11:00:16 AM
Last modification on : Wednesday, February 26, 2020 - 11:14:02 AM
Long-term archiving on: : Thursday, April 10, 2014 - 2:50:31 PM

File

csur.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Anne Benoit, Umit Catalyurek, Yves Robert, Erik Saule. A Survey of Pipelined Workflow Scheduling: Models and Algorithms. ACM Computing Surveys, Association for Computing Machinery, 2013, 45 (4), ⟨10.1145/2501654.2501664⟩. ⟨hal-00926178⟩

Share

Metrics

Record views

264

Files downloads

758