Skip to Main content Skip to Navigation
New interface
Conference papers

Generalized mixed-criticality scheduling based on RUN

Abstract : Recent works on mixed--criticality (MC) scheduling algorithms have produced impressive results in terms of schedulability performances but at the expense of a large number of preemptions. Besides, not all MC scheduling algorithms can handle more than two criticality levels. Thus, current MC scheduling algorithms perform well in one of these three criteria but poorly in the others. For instance, our recent contribution, MxC-RUN, entails a limited number of preemptions but provides average schedulability performances and cannot handle systems with more than two criticality levels. In this paper, we present GMC-RUN, an approach that deeply revisits the main principles of MxC-RUN to address these three criteria. Comparisons with other scheduling algorithms show that GMC-RUN exhibits very good performances concerning schedulability ratio but also impressively low numbers of preemptions. Thanks to the notion of criticality level reduction, GMC-RUN successfully handles systems with any number of criticality levels.
Complete list of metadata
Contributor : Patrice Aknin Connect in order to contact the contributor
Submitted on : Monday, April 4, 2022 - 9:13:13 AM
Last modification on : Tuesday, October 18, 2022 - 8:34:05 AM



Romain Gratia, Thomas Robert, Laurent Pautet. Generalized mixed-criticality scheduling based on RUN. 23rd International Conference on Real-Time Networks and Systems (RTNS '15), Nov 2015, Lille France, France. pp.267-276, ⟨10.1145/2834848.2834873⟩. ⟨hal-03629047⟩



Record views