Guaranteed on-line weakly-hard real-time systems

A weakly hard real-time system is a system that can tolerate some degree of missed deadlines provided that this number is bounded and guaranteed off-line. In this paper we present an on-line scheduling framework called Bi-Modal Scheduler (BMS) for weakly-hard real-time systems. It is characterised by two modes of operation. In normal mode tasks can be scheduled with a generic scheduler (possibly best-effort). Weakly hard constraints are guaranteed to be satisfied by switching, whenever necessary, to a panic mode for which schedulability tests exist that guarantee that deadlines are met. Due to the sources of pessimism in the analysis (mainly WCET and critical instant assumptions) the worst case situations may never arise, thus almost all the time all deadlines are met, only at peak loads some deadlines may be missed, however the behaviour of the system is predicable and bounded This allows building systems which maximise resource usage during normal operation and that resort to a guaranteed and predictable performance degradation specified by the weakly hard constraints should a transient overload arise.

[1]  Alan Burns,et al.  Dual Priority Assignment: A Practical Method For Increasing Processor Utilisation , 1993, Fifth Euromicro Workshop on Real-Time Systems.

[2]  Alan Burns,et al.  Weakly Hard Real-Time Systems , 2001, IEEE Trans. Computers.

[3]  Parameswaran Ramanathan,et al.  Evaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines , 1997, IEEE Trans. Computers.

[4]  Christian Poellabauer,et al.  Analysis of a window-constrained scheduler for real-time and best-effort packet streams , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[5]  Parameswaran Ramanathan,et al.  A Dynamic Priority Assignement Technique for Streams with (m, k)-Firm Deadlines , 1995, IEEE Trans. Computers.

[6]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[7]  Horst F. Wedde,et al.  Distributed real-time task monitoring in the safety-critical system Melody , 1999, Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99.

[8]  Andy J. Wellings,et al.  Dual priority scheduling , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[9]  Alan Burns,et al.  Combining (/sub m//sup n/)-hard deadlines and dual priority scheduling , 1997, Proceedings Real-Time Systems Symposium.

[10]  Dennis Shasha,et al.  Skip-Over: algorithms and complexity for overloaded systems that allow skips , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[11]  Aloysius K. Mok,et al.  A multiframe model for real-time tasks , 1996, 17th IEEE Real-Time Systems Symposium.

[12]  Christian Poellabauer,et al.  An Optimal, On-Line Window-Constrained Scheduler for Real-Time, Heterogeneous Activities , 1999 .

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

[14]  Giorgio C. Buttazzo,et al.  Minimizing Aperiodic Response Times in a Firm Real-Time Environment , 1999, IEEE Trans. Software Eng..

[15]  Gang Quan,et al.  Enhanced fixed-priority scheduling with (m,k)-firm guarantee , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[16]  Giorgio C. Buttazzo,et al.  Exploiting skips in periodic tasks for enhancing aperiodic responsiveness , 1997, Proceedings Real-Time Systems Symposium.