Oliver Gettings
ABSTRACT
Current adaptive mixed criticality scheduling policies assume a high criticality mode in which all low criticality tasks are descheduled to ensure that high criticality tasks can meet timing constraints derived from certification approved methods. In this paper we present a new scheduling policy, Adaptive Mixed Criticality - Weakly Hard, which provides a guaranteed minimum quality of service for low criticality tasks in the event of a criticality mode change. We derive response time based schedulability tests for this model. Empirical evaluations are then used to assess the relative performance against previously published policies and their schedulability tests.
- N. Audsley. On priority assignment in fixed priority scheduling. Information Processing Letters, 79(1):39--44, 2001. Google Scholar
Digital Library
- N. Audsley, A. Burns, M. F. Richardson, and A. J. Wellings. Hard real-time scheduling: The deadline-monotonic approach. In Proceedings of IEEE Workshop on Real-Time Operating Systems and Software, pages 133--137, 1991.Google ScholarCross Ref
- S. Baruah, A. Burns, and R. Davis. Response-time analysis for mixed criticality systems. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), pages 34--43, 2011. Google ScholarDigital Library
- S. Baruah and S. Vestal. Schedulability analysis of sporadic tasks with multiple criticality specifications. In Proceedings of Euromicro Conference on Real-Time Systems (ECRTS), pages 147--155, July 2008. Google ScholarDigital Library
- A. Bastoni, B. Brandenburg, and J. Anderson. Cache-related preemption and migration delays: Empirical approximation and impact on schedulability. In Proceedings of OSPERT, pages 33--44, 2010.Google Scholar
- I. Bate, A. Burns, and R. I. Davis. A bailout protocol for mixed criticality systems. In Proceedings 27th Euromicro Conference on Real-Time Systems (ECRTS) 2015, pages 259--268, 2015.Google ScholarDigital Library
- G. Bernat, A. Burns, and A. Liamosi. Weakly hard real-time systems. IEEE Transactions on Computers, 50(4):308--321, Apr 2001. Google ScholarDigital Library
- G. Bernat and R. Cayssials. Guaranteed on-line weakly-hard real-time systems. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), Dec 2001. Google ScholarDigital Library
- E. Bini and G. C. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, 30(1-2):129--154, May 2005. Google ScholarDigital Library
- A. Burns and S. Baruah. Timing faults and mixed criticality systems. In Dependable and Historic Computing, volume 6875 of Lecture Notes in Computer Science, pages 147--166. Springer Berlin Heidelberg, 2011. Google ScholarDigital Library
- A. Burns and S. Baruah. Towards a more practical model for mixed criticality systems. In Workshop on Mixed-Criticality Systems (colocated with RTSS), 2013.Google Scholar
- A. Burns and R. Davis. Adaptive mixed criticality scheduling with deferred preemption. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), pages 21--30, 2014.Google ScholarCross Ref
- R. Davis and M. Bertogna. Optimal fixed priority scheduling with deferred pre-emption. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), pages 39--50, 2012. Google ScholarDigital Library
- R. Davis and A. Burns. Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Real-Time Systems, 47(1):1--40, 2011. Google ScholarDigital Library
- F. Dorin, P. Richard, M. Richard, and J. Goossens. Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities. Real-Time Systems, 46(3):305--331, 2010. Google ScholarDigital Library
- J. Erickson, N. Kim, and J. Anderson. Recovering from overload in multicore mixed-criticality systems. In IEEE International Parallel and Distributed Processing Symposium (IPDPS), May 2015.Google ScholarDigital Library
- T. Fleming and A. Burns. Extending mixed criticality scheduling. In Proceedings of Workshop on Mixed Criticality, IEEE Real-Time Systems Symposium (RTSS), pages 7--12, 2013.Google Scholar
- T. Fleming and A. Burns. Incorporating the notion of importance into mixed criticality systems. In Proceedings of Workshop on Mixed Criticality, IEEE Real-Time Systems Symposium (RTSS), pages 33--38, 2014.Google Scholar
- G. Frehse, A. Hamann, S. Quinton, and M. Woehrle. Formal analysis of timing effects on closed-loop properties of control software. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), pages 53--62, 2014.Google ScholarCross Ref
- X. Gu, A. Easwaran, K.-M. Phan, and I. Shin. Resource efficient isolation mechanisms in mixed-criticality scheduling. In 27th Euromicro Conference on Real-Time Systems (ECRTS), pages 13--24, July 2015.Google ScholarDigital Library
- Z. A. H. Hammadeh, S. Quinton, and R. Ernst. Extending typical worst-case analysis using response-time dependencies to bound deadline misses. In 2014 International Conference on Embedded Software, EMSOFT 2014, New Delhi, India, October 12-17, 2014, pages 10:1--10:10, 2014. Google ScholarDigital Library
- M. Jan, L. Zaourar, and M. Pitel. Maximizing the execution rate of low-criticality tasks in mixed criticality system. In Proceedings of Workshop on Mixed Criticality, IEEE Real-Time Systems Symposium (RTSS), pages 43--48, 2013.Google Scholar
- M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal, 29(5):390--395, 1986.Google ScholarCross Ref
- G. Koren and D. Shasha. Skip-over: algorithms and complexity for overloaded systems that allow skips. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), pages 110--117, Dec 1995. Google ScholarDigital Library
- C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM, 20(1):46--61, Jan. 1973. Google ScholarDigital Library
- P. Ramanathan and M. Hamdaoui. A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Transactions on Computers, 44(12):1443--1451, Dec. 1995. Google ScholarDigital Library
- F. Santy, L. George, P. Thierry, and J. Goossens. Relaxing mixed-criticality scheduling strictness for task sets scheduled with fp. In Proceedings of Euromicro Conference on Real-Time Systems (ECRTS), pages 155--165, July 2012. Google ScholarDigital Library
- H. Su and D. Zhu. An elastic mixed-criticality task model and its scheduling algorithm. In Design, Automation Test in Europe Conference Exhibition (DATE), 2013, pages 147--152, March 2013. Google ScholarDigital Library
- S. Vestal. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), pages 239--243, 2007. Google ScholarDigital Library
- E. Yip, M. Kuo, P. Roop, and D. Broman. Relaxing the synchronous approach for mixed-criticality systems. In Proceedings of Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 89--100, April 2014.Google ScholarCross Ref
Index Terms
- Mixed criticality systems with weakly-hard constraints
Recommendations
A Survey of Research into Mixed Criticality Systems
This survey covers research into mixed criticality systems that has been published since Vestal’s seminal paper in 2007, up until the end of 2016. The survey is organised along the lines of the major research areas within this topic. These include ...
Response-Time Analysis for Mixed Criticality Systems
RTSS '11: Proceedings of the 2011 IEEE 32nd Real-Time Systems SymposiumMany safety-critical embedded systems are subject to certification requirements. However, only a subset of the functionality of the system may be safety-critical and hence subject to certification, the rest of the functionality is non safety-critical ...
Accurate Strategy for Mixed Criticality Scheduling
Verification and Evaluation of Computer and Communication SystemsAbstractIn mixed criticality systems, functionalities with different criticalities share the same execution platform. The goal of a mixed criticality scheduling algorithm is to ensure a safe execution of the highest criticality tasks while using ...
Comments