Weakly hard real-time systems
Top Cited Papers
- 1 April 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 50 (4) , 308-321
- https://doi.org/10.1109/12.919277
Abstract
In a hard real-time system, it is assumed that no deadline is missed, whereas, in a soft or firm real-time system, deadlines can be missed, although this usually happens in a nonpredictable way. However, most hard real-time systems could miss some deadlines provided that it happens in a known and predictable way. Also, adding predictability on the pattern of missed deadlines for soft and firm real-time systems is desirable, for instance, to guarantee levels of quality of service. We introduce the concept of weakly hard real-time systems to model real-time systems that can tolerate a clearly specified degree of missed deadlines. For this purpose, we define four temporal constraints based on determining a maximum number of deadlines that can be missed during a window of time (a given number of invocations). This paper provides the theoretical analysis of the properties and relationships of these constraints. It also shows the exact conditions under which a constraint is harder to satisfy than another constraint. Finally, results on fixed priority scheduling and response-time schedulability tests for a wide range of process models are presented.Keywords
This publication has 15 references indexed in Scilit:
- D/sup over/; an optimal on-line scheduling algorithm for overloaded real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Building a predictable avionics platform in Ada: a case studyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Combining (/sub m//sup n/)-hard deadlines and dual priority schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Robust aperiodic scheduling under dynamic priority systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Analysis of a window-constrained scheduler for real-time and best-effort packet streamsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Integrating multimedia applications in hard real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1998
- Fundamentals of Implementing Real-Time Control Applications in Distributed Computer SystemsReal-Time Systems, 1998
- Building Large, Complex, Distributed Safety-Critical Operating SystemsPublished by Springer Nature ,1997
- A dynamic priority assignment technique for streams with (m, k)-firm deadlinesIEEE Transactions on Computers, 1995
- Applying new scheduling theory to static priority pre-emptive schedulingSoftware Engineering Journal, 1993