Abstract
In a periodic real-time system scheduled by the EDF (Earliest Deadline First) algorithm (Liu and Layland, J. ACM 20(1), 40–61, 1973; Barauh, Proc. of the 27th IEEE International Real-Time Systems Symposium, 379–387, 2006; Buttazzo, J. Real-Time Syst. 29(1), 5–26, 2005), when new tasks have to be inserted into the system at run-time and/or current tasks request to increase their rates in response to internal or external events, the new sum of the utilizations after the insertion and/or acceleration should be limited, otherwise, one or more current tasks should usually be compressed (their periods being prolonged) in order to avoid overload. Buttazzo offered a time from which on this kind of adjustment can be done without causing any deadline miss in the system (Buttazzo et al., IEEE Trans. Comput. 51(3), 289–302, 2002). It is, however, not early enough. In this paper, an earlier time is given and formally proved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdelzaher TF, Aktins EM, Shin KG (1997) QoS negotiation in real-time systems and its applications to automated flight control. In: Proc IEEE real-time technology and applications symp, June 1997
Barauh SK (2006) Resource sharing in EDF-scheduled systems: a closer look[C]. In: Proc. of the 27th IEEE international real-time systems symposium, Rio de Janeiro, Brazil, December, 2006, pp 379–387
Buttazzo GC (1997) Hard real-time computing systems: predictable scheduling algorithms and applications. Kluwer Academic, Boston, pp 102–103
Buttazzo GC (2005) Rate monotonic vs. EDF: judgment day. J Real-Time Syst 29(1):5–26
Buttazzo GC, Lipari G, Abeni L (1998) Elastic task model for adaptive rate control. In: Proc 19th IEEE real-time systems symp, Dec 1998
Buttazzo GC, Lipari G, Caccamo M, Abeni L (2002) Elastic scheduling for flexible workload management. IEEE Trans Comput 51(3):289–302
Jeffay K, Stone DL (1993) Accounting for interrupt handling costs in dynamic priority task systems. In: Proc IEEE real-time systems symp, Dec 1993
Kbarauh S, Howell RR, Rosier LE (1990) Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. J Real-Time Syst 2:301–324
Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20(1):40–61
Sha L, Rajkumar R, Lehoczky JP (1990) Priority inheritance protocols: an approach to real-time synchronization. IEEE Trans Comput 39(9):1175–1185
Xu J, Parnas DL (1993) On satisfying time constraints in hard-real-time systems. IEEE Trans Software Eng 19(1):70–84
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Guangming, Q. An earlier time for inserting and/or accelerating tasks. Real-Time Syst 41, 181–194 (2009). https://doi.org/10.1007/s11241-009-9066-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-009-9066-9