The Community for Technology Leaders
Green Image
Issue No. 10 - October (2007 vol. 56)
ISSN: 0018-9340
pp: 1372-1386
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 a 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 necessarily have the same execution time. We also provide an online version of the algorithm that does not require a priori knowledge of release times. The online algorithm runs in O(m ldr k2) 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 nonpreemptively and we formally show that the problem becomes intractable under that assumption.
dynamic programming, fault tolerance, real-time systems, scheduling, system recovery, task analysis,fault-sensitive feasibility analysis, real-time task, dynamic programming technique, earliest-deadline-first scheduling, recovery block, processor demand analysis, online algorithm,Real time systems, Transient analysis, Circuit faults, Timing, Processor scheduling, Redundancy, Fault tolerance,Real-time Scheduling, Real-Time Systems, Fault Tolerance, Deadline-driven Systems, Recovery Blocks, Processor Demand Analysis
"Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks", IEEE Transactions on Computers, vol. 56, no. , pp. 1372-1386, October 2007, doi:10.1109/TC.2007.70739
96 ms
(Ver 3.3 (11022016))