Abstract
The hard deadline model is very popular in real-time research, but is representative or applicable to a small number of systems. Many applications, including control systems, are capable of tolerating occasional deadline misses, but are seriously compromised by a repeating pattern of late terminations. The weakly hard real-time model tries to capture these requirements by analyzing the conditions that guarantee that a maximum number of deadlines can be possibly missed in any set of consecutive activations. We provide a new weakly hard schedulability analysis method that applies to constrained-deadline periodic real-time systems scheduled with fixed priority and without knowledge of the task activation offsets. The analysis is based on a Mixed Integer Linear Programming (MILP) problem formulation; it is very general and can be adapted to include the consideration of resource sharing and activation jitter. A set of experiments conducted on an automotive engine control application and randomly generated tasksets show the applicability and accuracy of the proposed technique.
- Zaid Al-bayati, Youcheng Sun, Haibo Zeng, Marco Di Natale, Qi Zhu, and Brett Meyer. 2015. Task placement and selection of data consistency mechanisms for real-time multicore applications. In 21st IEEE Real-Time and Embedded Technology and Applications Symposium. 172--181.Google Scholar
- Amir Aminifar, Petru Eles, Zebo Peng, and Anton Cervin. 2013. Control-quality driven design of cyber-physical systems with robustness guarantees. In Proceedings of the Conference on Design, Automation and Test in Europe. EDA Consortium, 1093--1098. Google Scholar
Digital Library
- Amir Aminifar, Soheil Samii, Petru Eles, Zebo Peng, and Anton Cervin. 2012. Designing high-quality embedded control systems with guaranteed stability. In Real-Time Systems Symposium (RTSS), 2012 IEEE 33rd. 283--292. Google Scholar
Digital Library
- Karl-Erik Årzén, Anton Cervin, Johan Eker, and Lui Sha. 2000. An introduction to control and scheduling co-design. In Decision and Control, 2000. Proceedings of the 39th IEEE Conference on, Vol. 5. 4865--4870.Google Scholar
Cross Ref
- Sanjoy Baruah and Alan Burns. 2006. Sustainable scheduling analysis. In 27th IEEE International Real-Time Systems Symposium (RTSS). 159--168. Google Scholar
Digital Library
- Guillem Bernat, Alan Burns, and Albert Liamosi. 2001. Weakly hard real-time systems. Computers, IEEE Transactions on 50, 4 (2001), 308--321. Google Scholar
Digital Library
- Enrico Bini, Marco Di Natale, and Giorgio Buttazzo. 2008. Sensitivity analysis for fixed-priority real-time systems. Real-Time Systems 39, 1--3 (2008), 5--30. Google Scholar
Digital Library
- Alessandro Biondi, Marco Di Natale, Youcheng Sun, and Stefania Botta. 2016. Moving from Single-core to Multicore: Initial Findings on a Fuel Injection Case Study. Technical Report. SAE Technical Paper.Google Scholar
- Reinder J. Bril, Johan J. Lukkien, and Rudolf H. Mak. 2013. Best-case response times and jitter analysis of real-time tasks with arbitrary deadlines. In Proceedings of the 21st International Conference on Real-Time Networks and Systems. ACM, 193--202. Google Scholar
Digital Library
- Tobias Bund and Frank Slomka. 2014. Controller/platform co-design of networked control systems based on density functions. In Proceedings of the 4th ACM SIGBED International Workshop on Design, Modeling, and Evaluation of Cyber-Physical Systems. 11--14. Google Scholar
Digital Library
- Tobias Bund and Frank Slomka. 2015. Worst-case performance validation of safety-critical control systems with dropped samples. In Proceedings of the 23rd International Conference on Real Time and Networks Systems. 319--326. Google Scholar
Digital Library
- Giorgio Buttazzo. 2011. Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Vol. 24. Springer Science 8 Business Media. Google Scholar
- Robert I. Davis, Ken W. Tindell, and Alan Burns. 1993. Scheduling slack time in fixed priority pre-emptive systems. In Real-Time Systems Symposium. Proceedings. IEEE, 222--231.Google Scholar
- José Luis Díaz, Daniel F. García, Kanghee Kim, Chang-Gun Lee, L. Lo Bello, José María López, Sang Lyul Min, and Orazio Mirabella. 2002. Stochastic analysis of periodic real-time systems. In Real-Time Systems Symposium. RTSS. 23rd IEEE. IEEE, 289--300. Google Scholar
Digital Library
- Paul Emberson, Roger Stafford, and Robert I. Davis. 2010. Techniques for the synthesis of multiprocessor tasksets. In Proceedings 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS). 6--11.Google Scholar
- Goran Frehse, Arne Hamann, Sophie Quinton, and Matthias Woehrle. 2014. Formal analysis of timing effects on closed-loop properties of control software. In Real-Time Systems Symposium (RTSS), 2014 IEEE. 53--62.Google Scholar
Cross Ref
- Dip Goswami, Reinhard Schneider, and Samarjit Chakraborty. 2011. Co-design of cyber-physical systems via controllers with flexible delay constraints. In Proceedings of the 16th Asia and South Pacific Design Automation Conference. IEEE Press, 225--230. Google Scholar
Digital Library
- Zain A. H. Hammadeh, Sophie Quinton, and Rolf Ernst. 2014. Extending typical worst-case analysis using response-time dependencies to bound deadline misses. In Proceedings of the 14th International Conference on Embedded Software. ACM, 10. Google Scholar
Digital Library
- Jung-Eun Kim, Tarek F. Abdelzaher, and Lui Sha. 2015. Budgeted generalized rate monotonic analysis for the partitioned, yet globally scheduled uniprocessor model. In 21st IEEE Real-Time and Embedded Technology and Applications Symposium, Seattle, WA, USA, April 13-16, 2015. 221--231.Google Scholar
Cross Ref
- Pranaw Kumar and Lothar Thiele. 2012. Quantifying the effect of rare timing events with settling-time and overshoot. In Real-Time Systems Symposium (RTSS), 2012 IEEE 33rd. 149--160. Google Scholar
Digital Library
- John P. Lehoczky. 1990. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In RTSS, Vol. 90. 201--209.Google Scholar
- Joseph Y.-T. Leung and Jennifer Whitehead. 1982. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2, 4 (1982), 237--250.Google Scholar
- Chung Laung Liu and James W Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM (JACM) 20, 1 (1973), 46--61. Google Scholar
Digital Library
- M. M Hamdaoui and P. Ramanathan. 1995. A dynamic priority assignment technique for streams with (m, k)-firm deadlines. In IEEE Transactions on Computers. Google Scholar
Digital Library
- Sophie Quinton, Matthias Hanke, and Rolf Ernst. 2012. Formal analysis of sporadic overload in real-time systems. In Proceedings of the Conference on Design, Automation and Test in Europe. EDA Consortium, 515--520. Google Scholar
Digital Library
- Parameswaran Ramanathan. 1999. Overload management in real-time control applications using (m, k)-firm guarantee. IEEE Transactions on Parallel and Distributed Systems 10, 6 (1999), 549--559. Google Scholar
Digital Library
- Ola Redell and Martin Sanfridson. 2002. Exact best-case response time analysis of fixed priority scheduled tasks. In Real-Time Systems, 2002. Proceedings. 14th Euromicro Conference on. IEEE, 165--172. Google Scholar
Digital Library
- Lui Sha, Tarek Abdelzaher, Karl-Erik Årzén, Anton Cervin, Theodore Baker, Alan Burns, Giorgio Buttazzo, Marco Caccamo, John Lehoczky, and Aloysius K. Mok. 2004. Real time scheduling theory: A historical perspective. Real-time Systems 28, 2--3 (2004), 101--155. Google Scholar
Digital Library
- Lui Sha, Ragunathan Rajkumar, and John P. Lehoczky. 1990. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers 39, 9 (1990), 1175--1185. Google Scholar
Digital Library
- Damoon Soudbakhsh, Linh T. X. Phan, Anuradha M. Annaswamy, and Oleg Sokolsky. 2016. Co-design of arbitrated network control systems with overrun strategies. IEEE Transactions on Control of Network Systems (2016).Google Scholar
- Damoon Soudbakhsh, Linh T. X. Phan, Oleg Sokolsky, Insup Lee, and Anuradha Annaswamy. 2013. Co-design of control and platform with dropped signals. In Cyber-Physical Systems (ICCPS), 2013 ACM/IEEE International Conference on. 129--140. Google Scholar
Digital Library
- Alexander Wieder and Björn B. Brandenburg. 2013. Efficient partitioning of sporadic real-time tasks with shared resources and spin locks. In Industrial Embedded Systems (SIES), 2013 8th IEEE International Symposium on. 49--58.Google Scholar
- Wenbo Xu, Zain AH Hammadeh, Alexander Kroller, Rolf Ernst, and Sophie Quinton. 2015. Improved deadline miss models for real-time systems using typical worst-case analysis. In Real-Time Systems (ECRTS), 2015 27th Euromicro Conference on. IEEE, 247--256. Google Scholar
Digital Library
- Yang Xu, Karl-Erik Årzén, Enrico Bini, and Anton Cervin. 2014. Response time driven design of control systems. IFAC Proceedings Volumes 47, 3 (2014), 6098--6104.Google Scholar
Cross Ref
- Yang Xu, Karl-Erik Årzén, Anton Cervin, Enrico Bini, and Bogdan Tanasa. 2015. Exploiting job response-time information in the co-design of real-time control systems. In Embedded and Real-Time Computing Systems and Applications (RTCSA), 2015 IEEE 21st International Conference on. 247--256. Google Scholar
Digital Library
Index Terms
Weakly Hard Schedulability Analysis for Fixed Priority Scheduling of Periodic Real-Time Tasks
Recommendations
Generalized Weakly Hard Schedulability Analysis for Real-Time Periodic Tasks
The weakly hard real-time model is an abstraction for applications, including control systems, that can tolerate occasional deadline misses, but can also be compromised if a sufficiently high number of late terminations occur in a given time window. The ...
Weakly-hard Real-time Guarantees for Earliest Deadline First Scheduling of Independent Tasks
The current trend in modeling and analyzing real-time systems is toward tighter yet safe timing constraints. Many practical real-time systems can de facto sustain a bounded number of deadline-misses, i.e., they have Weakly-Hard Real-Time (WHRT) ...
Schedulability Analysis for Real-Time P-FRP Tasks under Fixed Priority Scheduling
RTCSA '15: Proceedings of the 2015 IEEE 21st International Conference on Embedded and Real-Time Computing Systems and ApplicationsThis paper studies the schedulability of real-time tasks in the Priority-based Functional Reactive Programming (P-FRP) model under fixed priority scheduling, one of the influential scheduling policies. Since the abort-and-restart execution paradigm of ...






Comments