Abstract
We consider Discrete Event Systems that can dynamically allocate resources in order to process tasks with real-time constraints. In the case of “weakly hard” constraints, a fraction of tasks is allowed to violate them, as long as m out of any k consecutive tasks meet their respective constraints. This is a generalization of a system with purely hard real-time constraints where m = k = 1. For non-preemptive and aperiodic tasks, we formulate an optimization problem where task processing times are controlled so as to minimize a cost function while guaranteeing that a “weakly hard” criterion is satisfied. We establish a number of structural properties of the solution to this problem which lead to an efficient algorithm that does not require any explicit nonlinear programming problem solver. The low complexity of this algorithm makes it suitable for on-line applications. Simulation examples illustrate the performance improvements in such optimally controlled systems compared to ad hoc schemes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aydin H, Melhem R, Mossé D, Mejia-Alvarez P (2004) Power-aware scheduling for periodic real-time tasks. IEEE Trans Comput 53(5):584–600, May
Bernat G, Burns A (1997) Combining (m,n)-hard deadlines and dual priority scheduling. In: RTSS ’97: Proceedings of the 18th IEEE real-time systems symposium (RTSS ’97). IEEE Computer Society, Los Alamitos, p 46
Bernat G, Burns A, Llamosi A (2001) Weakly hard real-time systems. IEEE Trans Comput 50(4):308–321
Cassandras CG, Zhuang S (2005) Optimal dynamic voltage scaling for wireless sensor nodes with real-time constraints. In: Proceedings of SPIE – intelligent systems in design and manufacturing VI, Boston, 24–26 October 2005
Gamal AE, Nair C, Prabhakar B, Uysal-Biyikoglu E, Zahedi S (2002) Energy-efficient scheduling of packet transmissions over wireless networks. In: Proceedings of IEEE INFOCOM, vol 3, 23–27. IEEE, New York, pp 1773–1782
Grant M, Boyd S, Ye Y (2008) CVX: Matlab software for disciplined convex programming (web page and software). Technical report, Stanford University
Hua S, Qu G (2004) Energy-efficient dual-voltage soft real-time system with (m,k)-firm deadline guarantee. In: CASES ’04: Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems. ACM, New York, pp 116–123
Jeffay K, Stanat DF, Martel CU (1991) On non-preemptive scheduling of periodic and sporadic tasks. In: Proc of the IEEE real-time systems symposium. IEEE, Piscataway, pp 129–139
Jonsson J, Lonn H, Shin KG (1999) Non-preemptive scheduling of real-time threads on multi-level-context architectures. In: Proceedings of the IEEE workshop on parallel and distributed real-time systems, vol 1586. Springer, Heidelberg, pp 363–374
Liu J (2000) Real-time system. Prentice Hall, Englewood Cliffs
Mao J, Cassandras CG (2006) Optimal control of multi-stage discrete event systems with real-time constraints. In: Proc of 45rd IEEE conf decision and control. IEEE, Piscataway, pp 1057–1062, Dec
Mao J, Cassandras CG (2007) Optimal control of two-stage discrete event systems with real-time constraints. J Discrete Event Dyn Syst 17(4):505–529
Mao J, Cassandras CG (2008) Optimal admission control of discrete event systems with real-time constraints. In Proc of 46rd IEEE conf decision and control. IEEE, Piscataway, pp 3005–3010, Dec
Mao J, Cassandras CG, Zhao QC (2007) Optimal dynamic voltage scaling in power-limited systems with real-time constraints. IEEE Trans Mobile Comput 6(6):678–688, June
Miao L, Cassandras CG (2006) Optimal transmission scheduling for energy-efficient wireless networks. In: Proceedings of INFOCOM, Barcelona, 23–29 April 2006
Miao L, Cassandras CG (2005) Optimality of static control policies in some discrete event systems. IEEE Trans Autom Control 50(9):1427–1431, Sep
Pepyne D, Cassandras CG (2000) Optimal control of hybrid systems in manufacturing. In: Proceedings of the IEEE, vol 88. IEEE, Piscataway, pp 1108–1123
Quan G, Niu L, Davis JP (2004) Power aware scheduling for real-time systems with (m,k)-guarantee. In: Proceedings CNDS-04: communication networks and distributed systems modeling and simulation, The Society for Modeling and Simulation International, San Diego, 10–12 January 2004
Ramanathan P (1997) Graceful degradation in real-time control applications using (m, k)-firm guarantee. In: Proceedings of the 27th international symposium on fault-tolerant computing (FTCS ’97), Washington, DC, USA. IEEE Computer Society, Los Alamitos, p 132
Ramanathan P (1999) Overload management in real-time control applications using (m,k)-firm guarantee. IEEE Trans Parallel Distrib Syst 10(6):549–559
Ramanathan P, Hamdaoui M (1995) A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Trans Comput 44(12):1443–1451
Yao F, Demers A, Shenker S (1995) A scheduling model for reduced CPU energy. In: Proceedings of the 36th annual symposium on foundations of computer science (FOCS’95). IEEE Computer Society, Los Alamitos, pp 374–382
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors’ work is supported in part by the National Science Foundation under Grants DMI-033017 and EFRI-0735974, by AFOSR under grants FA9550-07-1-0213 and FA9550-07-1-0361, and by DOE under Grant DE-FG52-06NA27490.
Rights and permissions
About this article
Cite this article
Zhuang, S., Cassandras, C.G. Optimal Control of Discrete Event Systems with Weakly Hard Real-Time Constraints. Discrete Event Dyn Syst 19, 67–89 (2009). https://doi.org/10.1007/s10626-008-0051-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10626-008-0051-6