Davis, Robert Ian orcid.org/0000-0002-5772-0928, Burns, Alan orcid.org/0000-0001-5621-8816 and Bate, Iain orcid.org/0000-0003-2415-8219 (2022) Compensating Adaptive Mixed Criticality Scheduling. In: Abdeddaïm, Yasmina, Cucu-Grosjean, Liliana, Nelissen, Geoffrey and Pautet, Laurent, (eds.) RTNS 2022 - Proceedings of the 30th International Conference on Real-Time Networks and Systems. 30th International Conference on Real-Time Networks and Systems, RTNS 2022, 07-08 Jun 2022 ACM International Conference Proceeding Series . ACM , FRA , pp. 81-93.
Abstract
The majority of prior academic research into mixed criticality systems assumes that if high-criticality tasks continue to execute beyond the execution time limits at which they would normally finish, then further workload due to low-criticality tasks may be dropped in order to ensure that the high-criticality tasks can still meet their deadlines. Industry, however, takes a different view of the importance of low-criticality tasks, with many practical systems unable to tolerate the abandonment of such tasks. In this paper, we address the challenge of supporting genuinely graceful degradation in mixed criticality systems, thus avoiding the abandonment problem. We explore the Compensating Adaptive Mixed Criticality (C-AMC) scheduling scheme. C-AMC ensures that both high- and low-criticality tasks meet their deadlines in both normal and degraded modes. Under C-AMC, jobs of low-criticality tasks, released in degraded mode, execute imprecise versions that provide essential functionality and outputs of sufficient quality, while also reducing the overall workload. This compensates, at least in part, for the overload due to the abnormal behavior of high-criticality tasks. C-AMC is based on fixed-priority preemptive scheduling and hence provides a viable migration path along which industry can make an evolutionary transition from current practice.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2022 Association for Computing Machinery. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details |
Keywords: | Real-Time,Schedulability Analysis,Fixed Priority,Mixed Criticality |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Funding Information: | Funder Grant number INNOVATE UK 113213/SUP-00007484 EPSRC EP/P003664/1 |
Depositing User: | Pure (York) |
Date Deposited: | 15 Jun 2022 09:20 |
Last Modified: | 27 Dec 2024 00:29 |
Published Version: | https://doi.org/10.1145/3534879.3534895 |
Status: | Published |
Publisher: | ACM |
Series Name: | ACM International Conference Proceeding Series |
Identification Number: | 10.1145/3534879.3534895 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:188037 |
Download
Filename: CAMCRTNS2022.pdf
Description: Compensating Adaptive Mixed Criticality Scheduling