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

Sajid Fadlelseed, Raimund Kirner, Catherine Menon

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

10 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationProceedings of Abstracts, School of Physics, Engineering and Computer Science Research Conference 2022
Place of PublicationHatfield, UK
PublisherUniversity of Hertfordshire
Pages58-60
Number of pages3
DOIs
Publication statusPublished - 4 Nov 2022
Event2nd School of Physics, Engineering and Computer Science Research Conference - Online - hosted by the School of Physics, Engineering and Computer Science, Hatfield, United Kingdom
Duration: 12 Apr 202212 Apr 2022
https://uhra.herts.ac.uk/handle/2299/25867

Conference

Conference2nd School of Physics, Engineering and Computer Science Research Conference
Abbreviated titleSPECS 2022
Country/TerritoryUnited Kingdom
CityHatfield
Period12/04/2212/04/22
Internet address

Keywords

  • real-time systems;
  • safety integrity level
  • scheduling
  • mixed-criticality

Fingerprint

Dive into the research topics of 'LBP-CA: A Short-term Scheduler with Criticality Arithmetic'. Together they form a unique fingerprint.

Cite this