Performance Measures for Multiprocessor Controllers
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Determining Redundancy Levels for Fault Tolerant Real-Time Systems
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Allocation and Scheduling of Precedence-Related Periodic Tasks
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Scheduling policies to support distributed 3D multimedia applications
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks
IEEE Transactions on Computers
A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis
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
Tolerance to Multiple Transient Faults for Aperiodic Tasks in Hard Real-Time Systems
IEEE Transactions on Computers
Analysis of Checkpointing for Real-Time Systems
Real-Time Systems
Specification and Analysis of Real-Time Problem Solvers
IEEE Transactions on Software Engineering
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A New Fault-Tolerant Technique for Improving the Schedulability in Multiprocessor Real-time Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Scheduling Fault-Tolerant Programs on Multiple Processors to Maximize Schedule Reliability
SAFECOMP '99 Proceedings of the 18th International Conference on Computer Computer Safety, Reliability and Security
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
Tolerating Transient Faults in Statically Scheduled Safety-Critical Embedded Systems
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
A Nonpreemptive Real-Time Scheduler with Recovery from Transient Faults and Its Implementation
IEEE Transactions on Software Engineering
The Interplay of Power Management and Fault Recovery in Real-Time Systems
IEEE Transactions on Computers
Fault-tolerant scheduling for real-time embedded control systems
Journal of Computer Science and Technology
Efficient overloading techniques for primary-backup scheduling in real-time systems
Journal of Parallel and Distributed Computing
An adaptive scheme for fault-tolerant scheduling of soft real-time tasks in multiprocessor systems
Journal of Parallel and Distributed Computing
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
Dual-mode r-reliable task model for flexible scheduling in reliable real-time systems
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous 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)
| Hi-index | 14.99 |
Multiprocessors used in life-critical real-time systems must recover quickly from failure. Part of this recovery consists of switching to a new task schedule that ensures that hard deadlines for critical tasks continue to be met. We present a dynamic programming algorithm that ensures that backup, or contingency, schedules can be efficiently embedded within the original, "primary" schedule to ensure that hard deadlines continue to be met in the face of up to a given maximum number of processor failures. Several illustrative examples are included.