Probabilistic Schedulability Guarantees for Dependable Real-Time Systems under Error Bursts

The fundamental requirement for the design of effective and efficient fault-tolerance mechanisms in dependable real-time systems is a realistic and applicable model of potential faults, their manifestations and consequences. Fault and error models also need to be evolved based on the characteristics of the operational environments or even based on technological advances. In this paper we propose a probabilistic burst error model in lieu of the commonly used simplistic fault assumptions in the context of processor scheduling. We present a novel schedulability analysis that accounts for the worst case interference caused by error bursts on the response times of tasks scheduled under the fixed priority scheduling (FPS) policy. Further, we describe a methodology for the calculation of probabilistic schedulability guarantees as a weighted sum of the conditional probabilities of schedulability under specified error burst characteristics. Finally, we identify potential sources of pessimism in the worst case response time calculations and discuss potential means for circumventing these issues.

[1]  Ian Broster,et al.  Flexibility in dependable real-time communication , 2003 .

[2]  N. D. Durie,et al.  Digest of papers , 1976 .

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

[4]  Hans A. Hansson,et al.  Response time analysis under errors for CAN , 2000, Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000.

[5]  H. O. Burton,et al.  Errors and error control , 1972 .

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

[7]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[8]  David Doose,et al.  Scheduling Analysis under Fault Bursts , 2011, 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium.

[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]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[11]  Jay K. Strosnider,et al.  The transient server approach to scheduling time-critical recovery operations , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[12]  Yeqiong Song,et al.  Worst-case deadline failure probability in real-time applications distributed over controller area network , 2000, J. Syst. Archit..

[13]  Alan Burns,et al.  Probabilistic analysis of CAN with faults , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

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

[15]  Alan Burns,et al.  Timing Analysis of Real-Time Communication Under Electromagnetic Interference , 2005, Real-Time Systems.

[16]  Ramesh Karri,et al.  Towards Nanoelectronics Processor Architectures , 2007, J. Electron. Test..

[17]  José Alberto Fonseca,et al.  An Experiment to Assess Bit Error Rate in CAN , 2004 .

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

[19]  José Rufino,et al.  Fault-tolerant broadcasts in CAN , 1998, Digest of Papers. Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing (Cat. No.98CB36224).

[20]  Sanjukta Bhanja,et al.  An Error Model to Study the Behavior of Transient Errors in Sequential Circuits , 2009, 2009 22nd International Conference on VLSI Design.

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

[22]  David Wright,et al.  Probabilistic scheduling guarantees for fault-tolerant real-time systems , 1999, Dependable Computing for Critical Applications 7.

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