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.
Type de document :
Article dans une revue
ACM Computing Surveys, Association for Computing Machinery, 2013, 45 (4), 〈10.1145/2501654.2501664〉
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00926178
Contributeur : Equipe Roma <>
Soumis le : jeudi 9 janvier 2014 - 11:00:16
Dernière modification le : vendredi 20 avril 2018 - 15:44:26
Document(s) archivé(s) le : jeudi 10 avril 2014 - 14:50:31

Fichier

csur.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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〉

Partager

Métriques

Consultations de la notice

191

Téléchargements de fichiers

508