Fault-tolerant deadline-monotonic algorithm for scheduling hard-real-time tasks

Abstract

The paper presents a fault tolerant scheduling algorithm for multiprocessor hard real time systems. The so called partitioning method is used to schedule a set of tasks in a multiprocessor system. Fault tolerance is achieved by using a combined duplication technique where each task scheduled on a processor has either an active or a passive copy scheduled on a different processor. Simulation experiments reveal a saving of processors with respect to those needed by the usual approach of duplicating the schedule of the non fault tolerant case.