Exact Fault-Tolerant Feasibility Analysis of Fixed-Priority Real-Time Tasks

In this paper, a necessary and sufficient (exact) feasibility test is proposed for fixed-priority scheduling of a periodic task set to tolerate multiple faults on uniprocessor. We consider a fault model such that multiple faults can occur in any task and at any time, even during recovery operations. The proposed test considers tolerating a maximum of f faults that can occur within any time interval equal to the largest relative deadline of the task set. The feasibility of the task set is checked based on the maximum workload requested by the higher-priority jobs within the released time and deadline of the job of each task that is released at the critical instant. The maximum workload is calculated using a novel technique to compose the execution time of the higher-priority jobs. To the best of our knowledge, no other work (assuming the same fault model as ours) has derived an exact feasibility test for periodic task sets having a lower time complexity than that of the test proposed in this paper.

[1]  Albert Meixner,et al.  A: L-C, C E D S C , 2008 .

[2]  Prabhakar Kudva,et al.  Soft-error resilience of the IBM POWER6 processor , 2008, IBM J. Res. Dev..

[3]  Hakan Aydin,et al.  Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks , 2007, IEEE Transactions on Computers.

[4]  Carl E. Landwehr,et al.  Basic concepts and taxonomy of dependable and secure computing , 2004, IEEE Transactions on Dependable and Secure Computing.

[5]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[6]  Rami G. Melhem,et al.  Enhancing real-time schedules to tolerate transient faults , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[7]  Rami G. Melhem,et al.  Fault-Tolerant Rate-Monotonic Scheduling , 1998, Real-Time Systems.

[8]  Robert Baumann,et al.  Soft errors in advanced computer systems , 2005, IEEE Design & Test of Computers.

[9]  Alan Burns,et al.  Feasibility analysis of fault-tolerant real-time task sets , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[10]  Rami G. Melhem,et al.  Tolerance to Multiple Transient Faults for Aperiodic Tasks in Hard Real-Time Systems , 2000, IEEE Trans. Computers.

[11]  Albert Meixner,et al.  Argus: Low-Cost, Comprehensive Error Detection in Simple Cores , 2008, IEEE Micro.

[12]  Miroslaw Malek,et al.  Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks , 1998, IEEE Trans. Computers.

[13]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[14]  Friedrich Eisenbrand,et al.  Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard , 2008, 2008 Real-Time Systems Symposium.

[15]  Sanjoy K. Baruah,et al.  Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.

[16]  Alan Burns,et al.  Analysis of Checkpointing for Real-Time Systems , 2004, Real-Time Systems.

[17]  Jorge Santos,et al.  New methods for redistributing slack time in real-time systems: applications and comparative evaluations , 2004, J. Syst. Softw..

[18]  Jorge Santos,et al.  A least upper bound on the fault tolerance of real-time systems , 2005, J. Syst. Softw..

[19]  Dakai Zhu,et al.  Reliability-Aware Energy Management for Periodic Real-Time Tasks , 2009, IEEE Trans. Computers.

[20]  A. Campbell,et al.  Single event upset rates in space , 1992 .

[21]  Maryline Chetto,et al.  Some Results of the Earliest Deadline Scheduling Algorithm , 1989, IEEE Transactions on Software Engineering.

[22]  Ravishankar K. Iyer,et al.  Measurement and modeling of computer reliability as affected by system activity , 1986, TOCS.

[23]  Alan Burns,et al.  An Optimal Fixed-Priority Assignment Algorithm for Supporting Fault-Tolerant Hard Real-Time Systems , 2003, IEEE Trans. Computers.

[24]  Kang G. Shin,et al.  A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults , 2003, IEEE Trans. Computers.

[25]  Sasikumar Punnekkat,et al.  Maximizing the Fault Tolerance Capability of Fixed Priority Schedules , 2008, 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.

[26]  Israel Koren,et al.  Fault-Tolerant Systems , 2007 .

[27]  Larry Kinnan,et al.  Software protection - Putting COTS back in the box , 2006 .

[28]  James Windsor,et al.  Time and Space Partitioning in Spacecraft Avionics , 2009, 2009 Third IEEE International Conference on Space Mission Challenges for Information Technology.