A Probabilistic Approach for Fault Tolerant Multiprocessor Real-time Scheduling

Vandy Berten Goossens Joël Emmanuel Jeannot 1
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we tackle the problem of scheduling a periodic real time system on identical multiprocessor platforms, moreover the tasks considered may fail with a given probability. For each task we compute its duplication rate in order to (1) given a maximum tolerated probability of failure, minimize the size of the platform such at least one replica of each job meets its deadline (and does not fail) using a variant of EDF namely EDF/sup (k)/ or (2) given the size of the platform, achieve the best possible reliability with the same constraints. Thanks to our probabilistic approach, no assumption is made on the number of failures which can occur. We propose several approaches to duplicate tasks and we show that we are able to find solutions always very close to the optimal one.
Type de document :
Communication dans un congrès
14th Workshop on Parallel and Distributed Real-Time Systems - WPDRTS 2006 (In conjunction with IPDPS 2006), 2006, Island of Rhodes, Greece, IEEE, 2006, 〈10.1109/IPDPS.2006.1639409〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00097248
Contributeur : Emmanuel Jeannot <>
Soumis le : jeudi 21 septembre 2006 - 11:44:14
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Lien texte intégral

Identifiants

Collections

Citation

Vandy Berten, Goossens Joël, Emmanuel Jeannot. A Probabilistic Approach for Fault Tolerant Multiprocessor Real-time Scheduling. 14th Workshop on Parallel and Distributed Real-Time Systems - WPDRTS 2006 (In conjunction with IPDPS 2006), 2006, Island of Rhodes, Greece, IEEE, 2006, 〈10.1109/IPDPS.2006.1639409〉. 〈inria-00097248〉

Partager

Métriques

Consultations de la notice

189