skip to main content
10.1145/3566097.3567851acmconferencesArticle/Chapter ViewAbstractPublication PagesaspdacConference Proceedingsconference-collections
research-article
Open Access

Mixed-Criticality with Integer Multiple WCETs and Dropping Relations: New Scheduling Challenges

Published:31 January 2023Publication History

ABSTRACT

Scheduling Mixed-Criticality (MC) workload is a challenging problem in real-time computing. Earliest Deadline First Virtual Deadline (EDF-VD) is one of the most famous scheduling algorithm with optimal speedup bound properties. However, when EDF-VD is used to schedule task sets using a model with additional or relaxed constraints, its scheduling properties change. Inspired by an application of MC to the scheduling of fault tolerant tasks, in this article, we propose two models for multiple criticality levels: the first is a specialization of the MC model, and the second is a generalization of it. We then show, via formal proofs and numerical simulations, that the former considerably improves the speedup bound of EDF-VD. Finally, we provide the proofs related to the optimality of the two models, identifying the need of new scheduling algorithms.

References

  1. S. Baruah, V. Bonifaci, G. DAngelo, H. Li, A. Marchetti-Spaccamela, S. van der Ster, and L. Stougie. 2012. The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems. In 2012 24th Euromicro Conference on Real-Time Systems. IEEE, Pisa, Italy, 145--154.Google ScholarGoogle Scholar
  2. 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. J. ACM 62, 2, Article 14 (may 2015), 33 pages.Google ScholarGoogle Scholar
  3. S. Baruah, H. Li, and L. Stougie. 2010. Towards the Design of Certifiable Mixed-criticality Systems. In 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium. IEEE, Stockholm, Sweden, 13--22.Google ScholarGoogle Scholar
  4. A. Bhuiyan, F. Reghenzani, W. Fornaciari, and Z. Guo. 2020. Optimizing Energy in Non-Preemptive Mixed-Criticality Scheduling by Exploiting Probabilistic Information. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39, 11 (2020), 3906--3917.Google ScholarGoogle ScholarCross RefCross Ref
  5. A. Burns and R.I. Davis. 2017. A Survey of Research into Mixed Criticality Systems. ACM Comput. Surv. 50, 6, Article 82 (nov 2017), 37 pages.Google ScholarGoogle Scholar
  6. R. Ernst and M. Di Natale. 2016. Mixed Criticality Systems---A History of Misconceptions? IEEE Design & Test 33, 5 (2016), 65--74.Google ScholarGoogle Scholar
  7. A. Esper, G. Nelissen, V. Nélis, and E. Tovar. 2015. How Realistic is the Mixed-Criticality Real-Time System Model?. In Proceedings of the 23rd International Conference on Real Time and Networks Systems. ACM, Lille, France, 139--148.Google ScholarGoogle Scholar
  8. Z. Guo, K. Yang, S. Vaidhun, S. Arefin, S.K. Das, and H. Xiong. 2018. Uniprocessor Mixed-Criticality Scheduling with Graceful Degradation by Completion Rate. In IEEE Real-Time Systems Symposium (RTSS). IEEE, Nashville, TN, USA, 373--383.Google ScholarGoogle Scholar
  9. F. Reghenzani, Z. Guo, L. Santinelli, and W. Fornaciari. 2022. A Mixed-Criticality Approach to Fault Tolerance: Integrating Schedulability and Failure Requirements. In 2022 IEEE 28th Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE, Milan, Italy, 27--39.Google ScholarGoogle Scholar
  10. S. Vestal. 2007. Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance. In 28th IEEE International Real-Time Systems Symposium (RTSS). IEEE, Tucson, AZ, USA, 239--243.Google ScholarGoogle Scholar
  11. M. Völp. 2014. What if we would degrade LO tasks in mixed-criticality systems?. In Work-in-Progress Session of the 20th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE, Berlin, Germany, 2 pages.Google ScholarGoogle Scholar

Index Terms

  1. Mixed-Criticality with Integer Multiple WCETs and Dropping Relations: New Scheduling Challenges

        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
        • Published in

          cover image ACM Conferences
          ASPDAC '23: Proceedings of the 28th Asia and South Pacific Design Automation Conference
          January 2023
          807 pages
          ISBN:9781450397834
          DOI:10.1145/3566097

          Copyright © 2023 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 31 January 2023

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          ASPDAC '23 Paper Acceptance Rate102of328submissions,31%Overall Acceptance Rate466of1,454submissions,32%

          Upcoming Conference

          ASPDAC '25

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader