Abstract
Feasibility tests for hard real-time systems provide information about the schedulability of the task set. However, this information is a yes or a no answer, that is, whether the task set achieves the test or not. From the real-time system design point of view, having more information available would be useful. For example, how much the computation time can vary without jeopardising the system feasibility. This work specifically provides methods to determine off-line how much a task can increase its computation time, by maintaining the system feasibility under a dynamic priority scheduling. The extra time can be determined not only in all the task activations, but in n of a window of m invocations. This is what we call a window-constrained execution time system. The results presented in this work can be used in all kinds of real-time systems: fault tolerance management, imprecise computation, overrun handling, control applications, etc.
Similar content being viewed by others
References
Astrom KJ (1987) Adaptive feedback control. Proc IEEE 75(2):185–217
Audsley N (1993) Flexible scheduling of hard real-time systems. Ph.D. thesis, Dept. Computer Science, University of York, UK
Balbastre P, Ripoll I, Crespo A (2002) Schedulability analysis of window-constrained execution time tasks for real-time control. In: 14th euromicro conference on real-time systems
Balbastre P, Ripoll I, Crespo A (2006) Optimal deadline assignment for periodic real-time tasks in dynamic priority systems. In: 18th euromicro conference on real-time systems IEEE Computer Society Press
Baruah S, Buttazzo G, Gorinsky S, Lipari G (1999) Scheduling periodic task systems to minimize output jitter. In: sixth conference on real-time computing systems and applications, pp 62–69
Baruah S, Mok A, Rosier L (1990) Preemptively scheduling hard real-time sporadic tasks on one processor. In: IEEE real-time systems symposium, pp 182–190
Bernat G (1998) Specification and analysis of weakly hard real-time systems. Ph.D. thesis, Universitat de les Illes Balears, Departament de Ciencies Matematiques i Informatica
Bresenham JE (1965) Algorithms por computer control of a digital plotter. IBM Syst J 4(1):25–30
Burns A, Punnekkat S, Littlewood B, Wright D (1997) Probabilistic guarantees for fault-tolerant real-time systems. Technical report, Design for Validation (DeVa) TR No. 44, Esprit Long Term Research Project No. 20072, Dept. of Computer Science, Univ. of Newcastle upon Tyne, UK
Burns A, Wellings AJ (1995) Engineering a hard real-time system: from theory to practice. Softw—Practice Exp 25(7):705–726
Buttazzo G, Lipari G, Abeni L (1998) Elastic task model for adaptive rate control. In: IEEE real-time systems symposium, pp 286–295
Cervin A (2005) Analysis of overrun strategies in periodic control tasks. In: Proc. 16th IFAC world congress. Prague, Czech Republic
Cervin A, Lincoln B, Eker J, Arzen K, Buttazzo G (2004) The jitter margin and its application in the design of real-time control systems. In: Proceedings of the IEEE conference on real-time and embedded computing systems and applications
Dertouzos M (1974) Control robotics: the procedural control of physical processors. In: IFIP congress, pp 807–813
Facchinetti T, Buttazzo G (2003) A real-time system for tracking and catching moving targets. In: 5th IFAC international symposium on intelligent components and instruments for control applications (SICICA 2003), pp 251–256
Ghosh S (1996) Guaranteeing fault Tolerance Through Scheduling in Real-Time Systems. Ph.D. thesis, Faculty of Arts and Sciences, Univ. of Pittsburgh
Hamdaoui M, Ramanathan P (1995) A dynamic priority assignement technique for streams with (m, k)-firm deadlines. IEEE Trans. Comp. 44(12):1443–1451
Lehoczky J, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: exact characterization and average case behaviour. In: IEEE real-time systems symposium, pp 166–171
Leung J, Merrill R (1980) A note on the preemptive scheduling of periodic, Real-Time tasks. Inf Proc Lett 18:115–118
Liu C, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. JACM 23:46–68
Liu JW-S, Lin K-J, Shih WK, shi Yu AC, Chung J-Y, Zhao W (1991) Algorithms for scheduling imprecise computations. IEEE Comp 24(5):58–68
Martí P, Fuertes JM, Fohler G (2001) Jitter compensation for real-time control systems. In: IEEE real-time systems symposium
Ramanathan P (1997) Graceful degradation in real-time control applications using (m, k)-firm guarantee. In: 27th international symposium on fault-tolerant computing (FTCS ’97)
Ripoll I, Crespo A, Mok A (1996) Improvement in feasibility testing for real-time tasks. J Real-Time Syst 11:19–40
Vestal S (1994) Fixed-priority sensitivity analysis for linear compute time models. IEEE Trans Softw Engi 20(4):308–317
West R, Poellabauer C (2000) Analysis of a window-constrained scheduler for real-time and best-effort packet streams. In: IEEE real-time systems symposium
Author information
Authors and Affiliations
Corresponding author
Additional information
Patricia Balbastre is an assistant professor of Computer Engineering. She graduated in Electronic Engineering at the Technical University of Valencia, Spain, in 1998. And the Ph.D. degree in Computer Science at the same university in 2002. Her main research interests include real-time operating systems, dynamic scheduling algorithms and real-time control.
Ismael Ripoll received the B.S. degree from the Polytechnic University of Valencia, Spain, in 1992; the Ph.D. degree in Computer Science at the Polytechnic University of Valencia, Spain, in 1996. Currently he is Professor in the DISCA Department of the same University. His research interests include embedded and real-time operating systems.
Alfons Crespo is Professor of the Department of Computer Engineering of the Technical University of Valencia. He received the PhD in Computer Science from the Technical University of Valencia, Spain, in 1984. He held the position of Associate professor in 1986 and full Professor in 1991. He leads the group of Industrial Informatics and has been the responsible of several European and Spanish research projects. His main research interest include different aspects of the real-time systems (scheduling, hardware support, scheduling and control integration, …). He has published more than 60 papers in specialised journals and conferences in the area of real-time systems.
Rights and permissions
About this article
Cite this article
Balbastre, P., Ripoll, I. & Crespo, A. Analysis of window-constrained execution time systems. Real-Time Syst 35, 109–134 (2007). https://doi.org/10.1007/s11241-006-9004-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-006-9004-z