A probabilistic approach for fault tolerant multiprocessor real-time scheduling

Authors:
Vandy Berten;Joël Goossens;Emmanuel Jeannot
Affiliations:
Université Libre de Bruxelles, Bruxelles, Belgium;Université Libre de Bruxelles, Bruxelles, Belgium;Loria INRIA-Lorraine, Vandoeuvre les Nancy, France
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 9
Cited 2

On Scheduling Tasks with a Quick Recovery from Failure

IEEE Transactions on Computers
Task Allocation for Maximizing Reliability of Distributed Computer Systems

IEEE Transactions on Computers
A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis

IEEE Transactions on Parallel and Distributed Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor System

Proceedings of the 8th International Symposium on Parallel Processing
A new fault-tolerant scheduling technique for real-time multiprocessor systems

RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors

Real-Time Systems
A Bi-Criteria Scheduling Heuristic for Distributed Embedded Systems under Reliability and Real-Time Constraints

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks

Scheduling for real-time mobile MapReduce systems

Proceedings of the 5th ACM international conference on Distributed event-based system
Satisfaction-based query replication

Distributed and Parallel Databases

Quantified Score

Hi-index	0.00

Visualization

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(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.