A Probabilistic Approach for Fault Tolerant Multiprocessor Real-time Scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

A Probabilistic Approach for Fault Tolerant Multiprocessor Real-time Scheduling

Vandy Berten
  • Function : Author
Goossens Joël
  • Function : Author
Emmanuel Jeannot

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.

Dates and versions

inria-00097248 , version 1 (21-09-2006)

Identifiers

Cite

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, ⟨10.1109/IPDPS.2006.1639409⟩. ⟨inria-00097248⟩
91 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More