A probabilistic approach for fault tolerant multiprocessor real-time scheduling

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 dupli-cation 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 dead-line (and does not fail) using a variant of EDF namely EDF(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. 1