A measurement-based model for workload dependence of CPU errors
IEEE Transactions on Computers - The MIT Press scientific computation series
Measurement and modeling of computer reliability as affected by system activity
ACM Transactions on Computer Systems (TOCS)
Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Introduction to algorithms
Fault-tolerant computer system design
Fault-tolerant computer system design
Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks
IEEE Transactions on Computers
Fault-Tolerant Rate-Monotonic Scheduling
Real-Time 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
Analysis of Checkpointing for Real-Time Systems
Real-Time Systems
Elastic Scheduling for Flexible Workload Management
IEEE Transactions on Computers
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults
IEEE Transactions on Computers
Probabilistic Scheduling Guarantees for Fault-Tolerant Real-Time Systems
DCCA '99 Proceedings of the conference on Dependable Computing for Critical Applications
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
The Interplay of Power Management and Fault Recovery in Real-Time Systems
IEEE Transactions on Computers
Power-Aware Scheduling for Periodic Real-Time Tasks
IEEE Transactions on Computers
Energy-Aware Fault Tolerance in Fixed-Priority Real-Time Embedded Systems
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Algorithm-Based Fault Tolerance for Matrix Operations
IEEE Transactions on Computers
Derivation and Calibration of a Transient Error Reliability Model
IEEE Transactions on Computers
Trading off transient fault tolerance and power consumption in deep submicron (DSM) VLSI circuits
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on the 2002 international symposium on low-power electronics and design (ISLPED)
Scheduling fixed-priority hard real-time tasks in the presence of faults
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems
IEEE Transactions on Computers
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Fault tolerance evaluation and schedulability analysis
Proceedings of the 2011 ACM Symposium on Applied Computing
Generalized reliability-oriented energy management for real-time embedded applications
Proceedings of the 48th Design Automation Conference
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
DFTS: A dynamic fault-tolerant scheduling for real-time tasks in multicore processors
Microprocessors & Microsystems
| Hi-index | 14.98 |
In this paper, we consider the problem of checking the feasibility of a set of n real-time tasks while provisioning for timely recovery from (at most) k transient faults. We extend the well-known Processor Demand Approach to take into account the extra overhead that may be induced by potential recovery operations under Earliest-Deadline-First scheduling. We develop a necessary and sufficient test using dynamic programming technique. An improvement upon the previous solutions is to address and efficiently solve the case where the recovery blocks associated with a given task do not have necessarily the same execution time. We also provide an on-line version of the algorithm that does not require a priori knowledge of release times. The on-line algorithm runs in O(m ⋅ k^2) time where m is the number of ready tasks. We extend the framework to periodic execution settings: we derive a sufficient condition that can be checked efficiently for the feasibility of periodic tasks in the presence of faults. Finally, we analyze the case where the recovery blocks are to be executed non-preemptively and we formally show that the problem becomes intractable under that assumption.