Scheduling for Reliability : complexity and Algorithms

Abstract : This thesis deals with the mapping and the scheduling of workflows. In this context, we consider unreliable platforms, with processors subject to failures. In a first part, we consider a particular model of streaming applications : the filtering services. In this context, we aim at minimizing period and latency. We first neglect communication costs. In this model, we study scheduling problems on homogeneous and heterogeneous platforms. Then, the impact of communication costs on scheduling problems of a filtering application is studied. Finally, we consider the scheduling problem of such an application on a chain of processors. The theoretical complexity of any variant of this problem is proved. This filtering property can model the reliability of processors. The results of some computations are successfully computed, and some other ones are lost. We consider the more frequent failure types : transient failures. We aim efficient and reliable schedules. The complexity of many variants of this problem is proved. Two heuristics are proposed and compared using using simulations. Even if transient failures are the most common failures in classical grids, some particular type of platform are more concerned by other type of problems. Desktop grids are especially unstable. In this context, we want to execute iterative applications. All tasks are executed, then a synchronization occurs, and so on. Two variants of this problem are considered : applicationsof independent tasks, and applications where all tasks need to be executed at same speed. In both cases, the problem is first theoretically studied, then heuristics are proposed and compared using simulations.
Document type :
Theses
Complete list of metadatas

Cited literature [103 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00660236
Contributor : Abes Star <>
Submitted on : Monday, January 16, 2012 - 11:32:38 AM
Last modification on : Thursday, November 8, 2018 - 2:26:11 PM
Long-term archiving on : Tuesday, April 17, 2012 - 2:25:49 AM

File

DUFOSSE_Fanny_2011_These.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00660236, version 1

Citation

Fanny Dufossé. Scheduling for Reliability : complexity and Algorithms. Other [cs.OH]. Ecole normale supérieure de lyon - ENS LYON, 2011. English. ⟨NNT : 2011ENSL0635⟩. ⟨tel-00660236⟩

Share

Metrics

Record views

634

Files downloads

354