A new fault-tolerant scheduling technique for real-time multiprocessor systems

Authors:
T. Tsuchiya;Y. Kakuda;T. Kikuno
Affiliations:
-;-;-
Venue:
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
Year:
1995

Citing 5
Cited 5

On Scheduling Tasks with a Quick Recovery from Failure

IEEE Transactions on Computers
Processor tradeoffs in distributed real-time systems

IEEE Transactions on Computers
Guarded repair of dependable systems

Theoretical Computer Science - Special issue on dependable parallel computing
Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor System

Proceedings of the 8th International Symposium on Parallel Processing
Fault-tolerant scheduling algorithm for distributed real-time systems

WPDRTS '95 Proceedings of the 3rd Workshop on Parallel and Distributed Real-Time Systems

A Nonpreemptive Real-Time Scheduler with Recovery from Transient Faults and Its Implementation

IEEE Transactions on Software Engineering
Exploiting redundancies to enhance schedulability in fault-tolerant and real-time distributed systems

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A probabilistic approach for fault tolerant multiprocessor real-time scheduling

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Boosting adaptivity of fault-tolerant scheduling for real-time tasks with service requirements on clusters

Journal of Systems and Software
Fault-tolerant scheduling in homogeneous real-time systems

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In multiprocessors used for implementing real-time applications, it is strongly required to ensure that tasks' deadlines are met in spite of faults. In this paper, we discuss fault-tolerant task scheduling techniques in real-time multiprocessor systems where aperiodic tasks arrive dynamically. For fault-tolerance, multiple copies of each task have to be scheduled on distinct processors in such systems. The authors propose a new technique for efficiently scheduling copies of tasks having small laxity. Then, we integrate our technique with previous work and develop a new scheduling algorithm, removing the assumption on task laxity. Simulation results show the effectiveness of our technique.