Scheduling Pipelined Applications: Models, Algorithms and Complexity

Anne Benoit 1
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : In this document, I explore the problem of scheduling pipelined applications onto large-scale distributed platforms, in order to optimize several criteria. A particular attention is given to throughput maximization (i.e., the number of data sets that can be processed every time unit), latency minimization (i.e., the time required to process one data set entirely), and failure probability minimization. First, I accurately define the models and the scheduling problems, and exhibit surprising results, such as the difficulty to compute the optimal throughput and/or latency that can be obtained given a mapping. In particular, I detail the importance of the communication models, which induce quite different levels of difficulty. Second, I give an overview of complexity results for various cases, both for mono-criterion and for bi-criteria optimization problems. I illustrate the impact of the models on the problem complexity. Finally, I show some extensions of this work to different applicative contexts and to dynamic platforms.
Document type :
Habilitation à diriger des recherches
Complete list of metadatas

https://tel.archives-ouvertes.fr/tel-00404147
Contributor : Anne Benoit <>
Submitted on : Thursday, July 16, 2009 - 12:33:53 PM
Last modification on : Friday, April 20, 2018 - 3:44:23 PM
Long-term archiving on : Saturday, November 26, 2016 - 10:47:00 AM

Identifiers

  • HAL Id : tel-00404147, version 2

Collections

Citation

Anne Benoit. Scheduling Pipelined Applications: Models, Algorithms and Complexity. Computer Science [cs]. Ecole normale supérieure de lyon - ENS LYON, 2009. ⟨tel-00404147v2⟩

Share

Metrics

Record views

386

Files downloads

544