Modular redundancy in a message passing system
IEEE Transactions on Software Engineering
On Scheduling Tasks with a Quick Recovery from Failure
IEEE Transactions on Computers
The Spring kernel: a new paradigm for real-time operating systems
ACM SIGOPS Operating Systems Review
An Environment for Developing Fault-Tolerant Software
IEEE Transactions on Software Engineering
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
A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis
IEEE Transactions on Parallel and Distributed Systems
Overload Management in Real-Time Control Applications Using m,k $(m,k)$-Firm Guarantee
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults
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 New Fault-Tolerant Technique for Improving the Schedulability in Multiprocessor Real-time Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor System
Proceedings of the 8th International Symposium on Parallel Processing
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
Optimal Scheduling for Fault-Tolerant and Firm Real-Time Systems
RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
Adaptive fault tolerance and graceful degradation under dynamic hard real-time scheduling
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Fault-tolerant scheduling algorithm for distributed real-time systems
WPDRTS '95 Proceedings of the 3rd Workshop on Parallel and Distributed Real-Time Systems
Real-Time Primary-Backup (RTPB) Replication with Temporal Consistency Guarantees
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Controlling schedulability-reliability trade-offs in real-time systems
Controlling schedulability-reliability trade-offs in real-time systems
An incremental approach to scheduling during overloads in real-time systems
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
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
IEICE - Transactions on Information and Systems
Journal of Systems and Software
A hybrid policy for fault tolerant load balancing in grid computing environments
Journal of Network and Computer Applications
Hi-index | 0.00 |
In real-time systems, tasks have deadlines to be met despite the presence of faults. Primary-Backup (PB) scheme is one of the most important schemes that has been employed for fault-tolerant scheduling of real-time tasks, wherein each task has two versions and the versions are scheduled on two different processors with time exclusion. There have been techniques proposed for improving schedulability of the PB-based scheduling, of which Backup-Backup (BB) overloading is among the most popular ones. In this technique two or more backups can share/overlap in time on a processor. In this paper, we propose two new techniques that accommodate more tasks and/or tolerate faults effectively. In the first technique, called dynamic grouping, the processors are dynamically grouped into logical groups in order to achieve efficient overloading of tasks on resources, thereby improving the schedulability and the reliability of the system. In the second technique, called PB overloading, the primary of a task can share/ overlap in time with the backup of another task on a processor. The intuition is that, for a primary (or backup), the PB-overloading can assign an earlier start time than that of the BB-overloading, thereby increasing the schedulability. We conduct schedulability and reliability analysis of the proposed techniques through simulation and analytical studies. Our studies show that dynamic grouping improves the schedulability more than static grouping, and offers graceful degradation with increasing faults. Also, PB-overloading improves the schedulability more than BB-overloading, and offers reliability comparable to that of BB-overloading. The proposed techniques are generic that they can be incorporated into many fault-tolerant non-preemptive scheduling algorithms.