Incorporating Robustness and Resilience into Mixed-Criticality Scheduling Theory

Sanjoy Baruah, Alan Burns

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Mixed-criticality scheduling theory (MCSh) was developed to allow for more resource-efficient implementation of systems comprising different components that need to have their correctness validated at different levels of assurance. As originally defined, MCSh deals exclusively with pre-runtime verification of such systems; hence many mixed-criticality scheduling algorithms that have been developed tend to exhibit rather poor survivability characteristics during run-time. (E.g., MCSh allows for less-important (\enquote{\lo-criticality}) workloads to be completely discarded in the event that run-time behavior is not compliant with the assumptions under which the correctness of the \lo-criticality workload should be verified.) Here we seek to extend MCSh to incorporate survivability considerations, by proposing quantitative metrics for the {\em robustness\/} and {\em resilience\/} of mixed-criticality scheduling algorithms. Such metrics allow us to make quantitative assertions regarding the survivability characteristics of mixed-criticality scheduling algorithms, and to compare different algorithms from the perspective of their survivability. We propose that MCSh seek to develop scheduling algorithms that possess superior survivability characteristics, thereby obtaining algorithms with better survivability properties than current ones (which, since they have been developed within a survivability-agnostic framework, tend to focus exclusively on pre-runtime verification and ignore survivability issues entirely).
Original languageEnglish
Title of host publication 2019 IEEE 22nd International Symposium on Real-Time Distributed Computing (ISORC)
Number of pages8
ISBN (Electronic)978-1-7281-0151-4
ISBN (Print)978-1-7281-0152-1
Publication statusPublished - 11 Jul 2019

Publication series

Namenternational Symposium on Real-Time Distributed Computing (ISORC)
ISSN (Electronic)2375-5261

Bibliographical note

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.

Cite this