A fault-tolerant scheduling problem
IEEE Transactions on Software Engineering
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
Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
Tolerance to Multiple Transient Faults for Aperiodic Tasks in Hard Real-Time Systems
IEEE Transactions on Computers
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Fault-tolerant scheduling for real-time embedded control systems
Journal of Computer Science and Technology
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A novel fault-tolerant scheduling algorithm for periodic tasks of distributed control systems
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
R&D challenges and emerging solutions for multicore deployment/configuration optimization
Proceedings of the FSE/SDP workshop on Future of software engineering research
A fault-tolerant reservation-based strategy for scheduling aperiodic tasks in multiprocessor systems
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Fault-tolerant scheduling based on periodic tasks for heterogeneous systems
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Scheduling fixed-priority hard real-time tasks in the presence of faults
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Fault-tolerant scheduling in homogeneous real-time systems
ACM Computing Surveys (CSUR)
Fault-tolerant hierarchical real-time scheduling with backup partitions on single processor
ACM SIGBED Review - Special Issue on the 5th Workshop on Adaptive and Reconfigurable Embedded Systems
Hi-index | 0.00 |
Hard-real-time systems require predictable performance despite the occurrence of failures. In this paper, fault tolerance is implemented by using a novel duplication technique where each task scheduled on a processor has either an active backup copy or a passive backup copy scheduled on a different processor. An active copy is always executed, while a passive copy is executed only in the case of a failure. First, the paper considers the ability of the widely-used Rate-Monotonic scheduling algorithm to meet the deadlines of periodic tasks in the presence of a processor failure. In particular, the Completion Time Test is extended so as to check the schedulability on a single processor of a task set including backup copies. Then, the paper extends the well-known Rate-Monotonic First-Fit assignment algorithm, where all the task copies, included the backup copies, are considered by Rate-Monotonic priority order and assigned to the first processor in which they fit. The proposed algorithm determines which tasks must use the active duplication and which can use the passive duplication. Passive duplication is preferred whenever possible, so as to overbook each processor with many passive copies whose primary copies are assigned to different processors. Moreover, the space allocated to active copies is reclaimed as soon as a failure is detected. Passive copy overbooking and active copy deallocation allow many passive copies to be scheduled sharing the same time intervals on the same processor, thus reducing the total number of processors needed. Simulation studies reveal a remarkable saving of processors with respect to those needed by the usual active duplication approach in which the schedule of the non-fault-tolerant case is duplicated on two sets of processors.