Abstract
Systems in many safety-critical application domains are subject to certification requirements. In such a system, there are typically different applications providing functionalities that have varying degrees of criticality. Consequently, the certification requirements for functionalities at these different criticality levels are also varying, with very high levels of assurance required for a highly critical functionality, whereas relatively low levels of assurance are required for a less critical functionality. Considering the timing assurance given to various applications in the form of guaranteed budgets within deadlines, a theory of real-time scheduling for such multi-criticality systems has been recently under development. In particular, an algorithm called Earliest Deadline First with Virtual Deadlines (EDF-VD) has shown a lot of promise for systems with two criticality levels, especially in terms of practical performance demonstrated through experiment results. In this article, we design a new schedulability test for EDF-VD that extends these performance benefits to multi-criticality systems. We propose a new test based on demand bound functions and also present a novel virtual deadline assignment strategy. Through extensive experiments, we show that the proposed technique significantly outperforms existing strategies for a variety of generic real-time systems.
- 2008. ARINC653 - An Avionics Standard for Safe, Partitioned Systems. Wind River Systems/IEEE Seminar.Google Scholar
- N. Audsley. 1991. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. In The University of York Technical Report.Google Scholar
- S. Baruah, V. Bonifaci, G. D’Angelo, H. Li, and A. Marchetti-Spaccamela. 2012a. The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In ECRTS. Google Scholar
Digital Library
- S. Baruah, V. Bonifaci, G. D’Angelo, H. Li, A. Marchetti-Spaccamela, N. Megow, and L. Stougie. 2012b. Scheduling real-time mixed-criticality jobs. IEEE Transactions on Computers 61, 8 (2012), 1140--1152. Google Scholar
Digital Library
- S. Baruah, V. Bonifaci, G. D’Angelo, H. Li, A. Marchetti-Spaccamela, S. Van Der Ster, and L. Stougie. 2015. Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems. Journal of the ACM (JACM) 62, 2 (2015), 14. Google Scholar
Digital Library
- S. Baruah, V. Bonifaci, G. D’Angelo, A. Marchetti-Spaccamela, S. Van Der Ster, and L. Stougie. 2011a. Mixed-criticality scheduling of sporadic task systems. In Proceedings of the European Symposium on Algorithms (ESA). Google Scholar
Digital Library
- S. Baruah and A. Burns. 2011. Implementing mixed criticality systems in ada. In Proceedings of the Ada-Europe International Conference on Reliable Software Technologies. 174--188. Google Scholar
Digital Library
- S. Baruah, A. Burns, and R. Davis. 2011b. Response-time analysis for mixed criticality systems. In RTSS. 34--43. Google Scholar
Digital Library
- S. Baruah, H. Li, and L. Stougie. 2010. Towards the design of certifiable mixed-criticality systems. In RTAS. 13--22. Google Scholar
Digital Library
- S. Baruah, A. Mok, and L. Rosier. 1990. Preemptively scheduling hard-real-time sporadic tasks on one processor. In RTSS. 182--190.Google Scholar
- S. Baruah and S. Vestal. 2008. Schedulability analysis of sporadic tasks with multiple criticality specifications. In ECRTS. 147--155. Google Scholar
Digital Library
- Iain Bate, Alan Burns, and Robert I. Davis. 2015a. A bailout protocol for mixed criticality systems. In Proceedings of the 2015 27th Euromicro Conference on Real-Time Systems (ECRTS). IEEE, 259--268. Google Scholar
Digital Library
- Iain Bate, Alan Burns, and Robert I. Davis. 2015b. A bailout protocol for mixed criticality systems. In 27th Euromicro Conference on Real-Time Systems, ECRTS 2015, Lund, Sweden, July 8-10, 2015. 259--268. Google Scholar
Digital Library
- A. Burns, T. Fleming, and S. Baruah. 2015. Cyclic executives, multi-core platforms and mixed criticality applications. In Proceedings of the 2015 27th Euromicro Conference on Real-Time Systems (ECRTS). 3--12. Google Scholar
Digital Library
- Arvind Easwaran. 2013. Demand-based scheduling of mixed-criticality sporadic tasks on one processor. In RTSS. 78--87. Google Scholar
Digital Library
- P. Ekberg and W. Yi. 2012. Bounding and shaping the demand of mixed-criticality sporadic tasks. In ECRTS. 135--144. Google Scholar
Digital Library
- Pontus Ekberg and Wang Yi. 2014. Bounding and shaping the demand of generalized mixed-criticality sporadic task systems. Real-Time Systems 50, 1 (2014), 48--86. Google Scholar
Digital Library
- Thomas Fleming. 2013. Extending Mixed Criticality Scheduling. Ph.D. Dissertation. University of York.Google Scholar
- Xiaozhe Gu, A. Easwaran, Kieu-My Phan, and Insik Shin. 2015. Resource efficient isolation mechanisms in mixed-criticality scheduling. In Proceedings of the 2015 27th Euromicro Conference on Real-Time Systems (ECRTS). 13--24. Google Scholar
Digital Library
- Pengcheng Huang, Georgia Giannopoulou, Nikolay Stoimenov, and Lothar Thiele. 2014. Service adaptations for mixed-criticality systems. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC).Google Scholar
- Pengcheng Huang, Pratyush Kumar, Nikolay Stoimenov, and Lothar Thiele. 2013. Interference constraint graphA new specification for mixed-criticality systems. In Proceedings of the 2013 18th Conference on Emerging Technologies 8 Factory Automation (ETFA). IEEE, 1--8.Google Scholar
Cross Ref
- H. Li and S. Baruah. 2010. An algorithm for scheduling certifiable mixed-criticality sporadic task systems. In RTSS. 183--192. Google Scholar
Digital Library
- Aloysius Ka-Lau Mok. 1983. Fundamental design problems of distributed systems for the hard-real-time environment (Doctoral dissertation, Massachusetts Institute of Technology), 1983.Google Scholar
- Taeju Park and Soontae Kim. 2011. Dynamic scheduling algorithm and its schedulability analysis for certifiable dual-criticality systems. In Proceedings of the 9th ACM International Conference on Embedded Software. ACM, 253--262. Google Scholar
Digital Library
- John A. Stankovic, Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. 1998. Introduction. In Deadline Scheduling for Real-Time Systems. Springer, 1--11.Google Scholar
- Hang Su and Dakai Zhu. 2013. An elastic mixed-criticality task model and its scheduling algorithm. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE’13). EDA Consortium, San Jose, CA, 147--152. Google Scholar
Digital Library
- S. Vestal. 2007. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In RTSS. Google Scholar
Digital Library
Index Terms
Efficient Schedulability Test for Dynamic-Priority Scheduling of Mixed-Criticality Real-Time Systems
Recommendations
Dynamic scheduling algorithm and its schedulability analysis for certifiable dual-criticality systems
EMSOFT '11: Proceedings of the ninth ACM international conference on Embedded softwareReal-time embedded systems are becoming more complex to include multiple functionalities. Sharing a computing platform is a natural and effective solution to reducing the cost of those systems. However, the sharing can cause serious problems in mixed-...
Certification-Cognizant Time-Triggered Scheduling of Mixed-Criticality Systems
RTSS '11: Proceedings of the 2011 IEEE 32nd Real-Time Systems SymposiumIn many modern embedded platforms, safety-critical functionalities that must be certified correct to very high levels of assurance co-exist with less critical software that are not subject to certification requirements. Recent research in real-time ...
An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
The current literature of fixed-priority scheduling algorithms relies on sufficient tests to determine if a set of mixed-criticality sporadic tasks is schedulable on a single processor. The drawback of these safe tests is their pessimism, a matter that ...






Comments