A survey of pipelined workflow scheduling: Models and algorithms

  • Authors:

  • Anne Benoit;Ümit V. Çatalyürek;Yves Robert;Erik Saule

  • Affiliations:

  • École Normale Supérieure de Lyon, Cedex, France;The Ohio State University, Colombus, OH;École Normale Supérieure de Lyon and University of Tennessee Knoxville, Lyon Cedex, France;The Ohio State University, Colombus, OH

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

A large class of applications need to execute the same workflow on different datasets 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 article surveys the field by summing up and structuring known results and approaches.