LBP-CA: A Short-term Scheduler with Criticality Arithmetic
Author
Fadlelseed, Sajid
Kirner, Raimund
Menon, Catherine
Attention
2299/27065
Abstract
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.