LBP-CA: A Short-term Scheduler with Criticality Arithmetic

Fadlelseed, Sajid, Kirner, Raimund and Menon, Catherine (2022) LBP-CA: A Short-term Scheduler with Criticality Arithmetic. In: Proceedings of Abstracts, School of Physics, Engineering and Computer Science Research Conference 2022 :. University of Hertfordshire, GBR, pp. 58-60.
Copy

In safety-critical systems a smooth degradation of services is a way to deal with resource shortages. Criticality arithmetic is a technique to implement services of higher criticality by several tasks of lower criticality. In this paper, we present LBP-CA, a mixed-criticality scheduling protocol with smooth degradation based on criticality arithmetic. In the experiments we show that LPB-CA can schedule more tasks than related scheduling protocols (BP and LBP) in case of resource shortage, minimising the negative effect on low-criticality services. This is achieved by considering information about criticality arithmetic of services.


picture_as_pdf
SPECS_2022_PROCEEDINGS_OF_ABSTRACTS_published_version.pdf
subject
Published Version
Available under Creative Commons: BY 4.0

View Download

Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core MPEG-21 DIDL Data Cite XML EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads