A fault-tolerant scheduling problem
IEEE Transactions on Software Engineering
Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks
IEEE Transactions on Computers
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
Fault Tolerance: Principles and Practice
Fault Tolerance: Principles and Practice
A least upper bound on the fault tolerance of real-time systems
Journal of Systems and Software
Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks
IEEE Transactions on Computers
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
| Hi-index | 0.00 |
The use of real-time systems can differ from their initial design and requirements. New missions may take place in a more agressive environment and cause faults that are not managed by the initial fault tolerance mechanisms. Before attributing a new mission it is interesting to know the limits of a real-time system in order to avoid a new validation process. In this paper we intend to evaluate the fault resilience. We deal with the fault tolerant scheduling analysis under pseudo-periodic faults and fault bursts. We provide methods to compute the features of temporal fault distribution that maximize the Worst Case Response Time of tasks. Thus we are able to evaluate the maximum fault resilience of a task. We also provide the maximum fault resilience of the real-time system.