Design & analysis of fault tolerant digital systems
Design & analysis of fault tolerant digital systems
The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments
IEEE Transactions on Computers
Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Rate-Monotonic Scheduling
Real-Time Systems
Fault-Tolerant Rate-Monotonic First-Fit Scheduling in Hard-Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Tolerance to Multiple Transient Faults for Aperiodic Tasks in Hard Real-Time Systems
IEEE Transactions on Computers
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Real-Time Systems and Programming Languages: ADA 95, Real-Time Java, and Real-Time POSIX
Real-Time Systems and Programming Languages: ADA 95, Real-Time Java, and Real-Time POSIX
A Reservation-Based Algorithm for Scheduling Both Periodic and Aperiodic Real-Time Tasks
IEEE Transactions on Computers
Fault-tolerant scheduling for real-time embedded control systems
Journal of Computer Science and Technology
Hi-index | 0.00 |
Periodic and aperiodic tasks co-exist in many real-time systems. The periodic tasks typically arise from sensor data or control loops, while the aperiodic tasks generally arise from arbitrary events. Their time constraints need to be met even in the presence of faults. Considering the unpredictability of aperiodic tasks, this paper proposes a fault-tolerant reservation-based strategy (FTRB) to schedule aperiodic tasks by utilizing the processor time left unused by periodic tasks. The least upper bound of reserved processor time is derived analytically such that all available processor time may be exploited for servicing aperiodic tasks. Any newly arrived aperiodic task is scheduled on the first-fit processor by using an extended dynamic schedulability criterion. A primary/backup approach is used to schedule the primary and backup copy of each task on different processors to tolerate a processor failure. Our analysis and simulation results show that the processors can achieve high utilization and that the on-line implementation of aperiodic task scheduling is feasible.