A fault-tolerant scheduling problem
IEEE Transactions on Software Engineering
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
Scheduling Tasks with Resource Requirements in Hard Real-Time Systems
IEEE Transactions on Software Engineering
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
An Environment for Developing Fault-Tolerant Software
IEEE Transactions on Software Engineering
Determining Redundancy Levels for Fault Tolerant Real-Time Systems
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Real-Time Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IEEE Transactions on Computers
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Resource Reclaiming in Multiprocessor Real-Time 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
IEEE Transactions on Software Engineering
Graceful Degradation in Real-time Control Applications Using (m, k)-Firm Guarantee
FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
A New Study for Fault-tolerant Real-time Dynamic Scheduling Algorithms
HIPC '96 Proceedings of the Third International Conference on High-Performance Computing (HiPC '96)
Adaptive software fault tolerance policies with dynamic real-time guarantees
WORDS '96 Proceedings of the 2nd Workshop on Object-Oriented Real-Time Dependable Systems (WORDS '96)
Fault-tolerant scheduling algorithm for distributed real-time systems
WPDRTS '95 Proceedings of the 3rd Workshop on Parallel and Distributed Real-Time Systems
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
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
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
Towards Nanoelectronics Processor Architectures
Journal of Electronic Testing: Theory and Applications
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
Dynamic task scheduling with load balancing using parallel orthogonal particle swarm optimisation
International Journal of Bio-Inspired Computation
Reliability aware power management for dual-processor real-time embedded systems
Proceedings of the 47th Design Automation Conference
Reliability-aware scheduling strategy for heterogeneous distributed computing systems
Journal of Parallel and Distributed Computing
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
Proceedings of the Conference on Design, Automation and Test in Europe
A task remapping technique for reliable multi-core embedded systems
CODES/ISSS '10 Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
A probabilistic approach for fault tolerant multiprocessor real-time scheduling
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Journal of Systems and Software
Mapping of applications to MPSoCs
CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
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
Rolling-horizon scheduling for energy constrained distributed real-time embedded systems
Journal of Systems and Software
Adaptive energy-efficient scheduling for real-time tasks on DVS-enabled heterogeneous clusters
Journal of Parallel and Distributed Computing
Dynamic task partition for video decoding on heterogeneous dual-core platforms
ACM Transactions on Embedded Computing Systems (TECS) - Special section on ESTIMedia'12, LCTES'11, rigorous embedded systems design, and multiprocessor system-on-chip for cyber-physical systems
Fault-tolerant scheduling in homogeneous real-time systems
ACM Computing Surveys (CSUR)
Failure-Aware Task Scheduling of Synchronous Data Flow Graphs Under Real-Time Constraints
Journal of Signal Processing Systems
On-chip sensor networks for soft-error tolerant real-time multiprocessor systems-on-chip
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Hi-index | 0.00 |
Many time-critical applications require dynamic scheduling with predictable performance. Tasks corresponding to these applications have deadlines to be met despite the presence of faults. In this paper, we propose an algorithm to dynamically schedule arriving real-time tasks with resource and fault-tolerant requirements on to multiprocessor systems. The tasks are assumed to be nonpreemptable and each task has two copies (versions) which are mutually excluded in space, as well as in time in the schedule, to handle permanent processor failures and to obtain better performance, respectively. Our algorithm can tolerate more than one fault at a time, and employs performance improving techniques such as 1) distance concept which decides the relative position of the two copies of a task in the task queue, 2) flexible backup overloading, which introduces a trade-off between degree of fault tolerance and performance, and 3) resource reclaiming, which reclaims resources both from deallocated backups and early completing tasks. We quantify, through simulation studies, the effectiveness of each of these techniques in improving the guarantee ratio, which is defined as the percentage of total tasks, arrived in the system, whose deadlines are met. Also, we compare through simulation studies the performance our algorithm with a best known algorithm for the problem, and show analytically the importance of distance parameter in fault-tolerant dynamic scheduling in multiprocessor real-time systems.