skip to main content
research-article

Efficient Schedulability Test for Dynamic-Priority Scheduling of Mixed-Criticality Real-Time Systems

Authors Info & Claims
Published:22 November 2017Publication History
Skip Abstract Section

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.

References

  1. 2008. ARINC653 - An Avionics Standard for Safe, Partitioned Systems. Wind River Systems/IEEE Seminar.Google ScholarGoogle Scholar
  2. N. Audsley. 1991. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. In The University of York Technical Report.Google ScholarGoogle Scholar
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Baruah, A. Burns, and R. Davis. 2011b. Response-time analysis for mixed criticality systems. In RTSS. 34--43. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Baruah, H. Li, and L. Stougie. 2010. Towards the design of certifiable mixed-criticality systems. In RTAS. 13--22. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. S. Baruah, A. Mok, and L. Rosier. 1990. Preemptively scheduling hard-real-time sporadic tasks on one processor. In RTSS. 182--190.Google ScholarGoogle Scholar
  11. S. Baruah and S. Vestal. 2008. Schedulability analysis of sporadic tasks with multiple criticality specifications. In ECRTS. 147--155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. Arvind Easwaran. 2013. Demand-based scheduling of mixed-criticality sporadic tasks on one processor. In RTSS. 78--87. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. P. Ekberg and W. Yi. 2012. Bounding and shaping the demand of mixed-criticality sporadic tasks. In ECRTS. 135--144. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  18. Thomas Fleming. 2013. Extending Mixed Criticality Scheduling. Ph.D. Dissertation. University of York.Google ScholarGoogle Scholar
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. 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 ScholarGoogle Scholar
  21. 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 ScholarGoogle ScholarCross RefCross Ref
  22. H. Li and S. Baruah. 2010. An algorithm for scheduling certifiable mixed-criticality sporadic task systems. In RTSS. 183--192. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 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 ScholarGoogle Scholar
  24. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  25. John A. Stankovic, Marco Spuri, Krithi Ramamritham, and Giorgio C. Buttazzo. 1998. Introduction. In Deadline Scheduling for Real-Time Systems. Springer, 1--11.Google ScholarGoogle Scholar
  26. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  27. S. Vestal. 2007. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In RTSS. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Efficient Schedulability Test for Dynamic-Priority Scheduling of Mixed-Criticality Real-Time Systems

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Embedded Computing Systems
      ACM Transactions on Embedded Computing Systems  Volume 17, Issue 1
      Special Issue on Autonomous Battery-Free Sensing and Communication, Special Issue on ESWEEK 2016 and Regular Papers
      January 2018
      630 pages
      ISSN:1539-9087
      EISSN:1558-3465
      DOI:10.1145/3136518
      Issue’s Table of Contents

      Copyright © 2017 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 22 November 2017
      • Accepted: 1 May 2017
      • Revised: 1 December 2016
      • Received: 1 December 2015
      Published in tecs Volume 17, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!