Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks

Authors:
Alan A. Bertossi;Andrea Fusiello;Luigi V. Mancini
Affiliations:
-;-;-
Venue:
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Year:
1997

Citing 10
Cited 4

On Scheduling Tasks with a Quick Recovery from Failure

IEEE Transactions on Computers
Decentralized Decision-Making for Task Reallocation in a Hard Real-Time System

IEEE Transactions on Computers
Distributed Scheduling of Tasks with Deadlines and Resource Requirements

IEEE Transactions on Computers
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems
Scheduling algorithms for fault-tolerance in hard-real-time systems

Real-Time Systems - Special issue on responsive computer systems
Enhancing fault-tolerance in rate-monotonic scheduling

Real-Time Systems - Special issue on responsive computer systems
Allocating fixed-priority periodic tasks on multiprocessor systems

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Implications of Classical Scheduling Results for Real-Time Systems

Computer

On the Scheduling of Flexible and Reliable Real-Time Control Systems

Real-Time Systems
An Improved Rate-Monotonic Admission Control and Its Applications

IEEE Transactions on Computers
Fault-tolerant average execution time optimization for general-purpose multi-processor system-on-chips

Proceedings of the Conference on Design, Automation and Test in Europe
A probabilistic approach for fault tolerant multiprocessor real-time scheduling

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new 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.