Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis
IEEE Transactions on Parallel and Distributed Systems
Analysis of Checkpointing for Real-Time Systems
Real-Time Systems
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
Fault-Tolerant Scheduling in Distributed Real-Time Systems
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Efficient overloading techniques for primary-backup scheduling in real-time systems
Journal of Parallel and Distributed Computing
Fault-tolerant scheduling in homogeneous real-time systems
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
In a distributed real-time system, tolerance to faults on processing nodes in the system is achieved by means of redundant nodes and a fault-tolerant scheduling algorithm. Since redundant nodes increase total failure rate of the system, the number of such redundant nodes should be small. This paper proposes a procedure for fault-tolerant scheduling, which realizes fault-tolerance via a small number of redundant nodes. The procedure is based on such a technique that allows multiple copies of a task to be executed concurrently. It achieves efficient utilization of nodes by forcing copies being executed to terminate immediately after having obtained the first result of these copies. A fundamental scheduling algorithm, into which the procedure is incorporated, is defined and its simulation results are shown.