Fault-tolerant computing: theory and techniques; vol. 1
Fault-tolerant computing: theory and techniques; vol. 1
A fault-tolerant scheduling problem
IEEE Transactions on Software Engineering
On Scheduling Tasks with a Quick Recovery from Failure
IEEE Transactions on Computers
Software—Practice & Experience
Scheduling Tasks with Resource Requirements in Hard Real-Time Systems
IEEE Transactions on Software Engineering
The MAFT Architecture for Distributed Fault Tolerance
IEEE Transactions on Computers - Fault-Tolerant Computing
Design & analysis of fault tolerant digital systems
Design & analysis of fault tolerant digital systems
Decentralized Decision-Making for Task Reallocation in a Hard Real-Time System
IEEE Transactions on Computers
The Spring kernel: a new paradigm for real-time operating systems
ACM SIGOPS Operating Systems Review
Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
Replicated distributed programs
Proceedings of the tenth ACM symposium on Operating systems principles
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
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
Minimum Achievable Utilization for Fault-Tolerant Processing of PeriodicTasks
Minimum Achievable Utilization for Fault-Tolerant Processing of PeriodicTasks
Fault-Tolerant Real Time Multiprocessor Scheduling
Fault-Tolerant Real Time Multiprocessor Scheduling
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
An Adaptive Scheme for Fault-Tolerant Scheduling of Soft Real-Time Tasks in Multiprocessor Systems
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
A Reliability-Aware Value-Based Scheduler for Dynamic Multiprocessor Real-Time Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
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
An Efficient Backup-Overloading for Fault-Tolerant Scheduling of Real-Time Tasks
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
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 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
Real-time Task Scheduling Using Extended Overloading Technique for Multiprocessor Systems
DS-RT '07 Proceedings of the 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Journal of Parallel and Distributed Computing
IEICE - Transactions on Information and Systems
Algorithms for testing fault-tolerance of sequenced jobs
Journal of Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
SAQA: A Self-Adaptive QoS-Aware Scheduling Algorithm for Real-Time Tasks on Heterogeneous Clusters
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
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
Journal of Systems and Software
A hybrid policy for fault tolerant load balancing in grid computing environments
Journal of Network and Computer Applications
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Fault Resilient Real-Time Design for NoC Architectures
ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems
Resource augmentation for fault-tolerance feasibility of real-time tasks under error bursts
Proceedings of the 20th International Conference on Real-Time and Network Systems
Proceedings of the 21st International conference on Real-Time Networks and Systems
Fault-tolerant scheduling in homogeneous real-time systems
ACM Computing Surveys (CSUR)
On-chip sensor networks for soft-error tolerant real-time multiprocessor systems-on-chip
ACM Journal on Emerging Technologies in Computing Systems (JETC)
DFTS: A dynamic fault-tolerant scheduling for real-time tasks in multicore processors
Microprocessors & Microsystems
| Hi-index | 0.01 |
Real-time systems are being increasingly used in several applications which are time critical in nature. Fault-tolerance is an important requirement of such systems, due to the catastrophic consequences of not tolerating faults. In this paper, we study a scheme that provides fault-tolerance through scheduling in real-time multiprocessor systems. We schedule multiple copies of dynamic, aperiodic, nonpreemptive tasks in the system, and use two techniques that we call deallocation and overloading to achieve high acceptance ratio (percentage of arriving tasks scheduled by the system). This paper compares the performance of our scheme with that of other fault-tolerant scheduling schemes, and determines how much each of deallocation and overloading affects the acceptance ratio of tasks. The paper also provides a technique that can help real-time system designers determine the number of processors required to provide fault-tolerance in dynamic systems. Lastly, a formal model is developed for the analysis of systems with uniform tasks.