Issue No. 10 - October (2007 vol. 56)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2007.70739
Hakan Aydin , IEEE
<p><b>Abstract</b>—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.</p>
Real-time Scheduling, Real-Time Systems, Fault Tolerance, Deadline-driven Systems, Recovery Blocks, Processor Demand Analysis
H. Aydin, "Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks," in IEEE Transactions on Computers, vol. 56, no. , pp. 1372-1386, 2007.