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.
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.
Item Type | Book Section |
---|---|
Additional information | © 2022 The Author(s). This is an open access conference paper distributed under the terms of the Creative Commons Attribution License (CC BY), https://creativecommons.org/licenses/by/4.0/ |
Keywords | real-time systems;, safety integrity level, scheduling, mixed-criticality, general computer science |
Date Deposited | 15 May 2025 16:48 |
Last Modified | 25 Jun 2025 23:15 |