Next Article in Journal
Design of Direct Injection Jet Ignition High Performance Naturally Aspirated Motorcycle Engines
Next Article in Special Issue
Correction: Sharpening the Scythe of Technological Change: Socio-Technical Challenges of Autonomous and Adaptive Cyber-Physical Systems
Previous Article in Journal
Probability Study on the Thermal Stress Distribution in Thick HK40 Stainless Steel Pipe Using Finite Element Method
Previous Article in Special Issue
Adaptive Time-Triggered Multi-Core Architecture
Article Menu

Export Article

Open AccessArticle
Designs 2019, 3(1), 10;

A Lazy Bailout Approach for Dual-Criticality Systems on Uniprocessor Platforms

The School of Engineering and Computer Science, University of Hertfordshire, College Lane, Hatfield AL10 9AB, UK
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Received: 20 October 2018 / Revised: 16 November 2018 / Accepted: 28 January 2019 / Published: 1 February 2019
Full-Text   |   PDF [997 KB, uploaded 26 February 2019]   |  


A challenge in the design of cyber-physical systems is to integrate the scheduling of tasks of different criticality, while still providing service guarantees for the higher critical tasks in the case of resource-shortages caused by faults. While standard real-time scheduling is agnostic to the criticality of tasks, the scheduling of tasks with different criticalities is called mixed-criticality scheduling. In this paper, we present the Lazy Bailout Protocol (LBP), a mixed-criticality scheduling method where low-criticality jobs overrunning their time budget cannot threaten the timeliness of high-criticality jobs while at the same time the method tries to complete as many low-criticality jobs as possible. The key principle of LBP is instead of immediately abandoning low-criticality jobs when a high-criticality job overruns its optimistic WCET estimate, to put them in a low-priority queue for later execution. To compare mixed-criticality scheduling methods, we introduce a formal quality criterion for mixed-criticality scheduling, which, above all else, compares schedulability of high-criticality jobs and only afterwards the schedulability of low-criticality jobs. Based on this criterion, we prove that LBP behaves better than the original Bailout Protocol (BP). We show that LBP can be further improved by slack time exploitation and by gain time collection at runtime, resulting in LBPSG. We also show that these improvements of LBP perform better than the analogous improvements based on BP. View Full-Text
Keywords: real-time systems; Fixed-Priority Preemptive Scheduling (FPPS); mixed-criticality systems; cyber-physical systems real-time systems; Fixed-Priority Preemptive Scheduling (FPPS); mixed-criticality systems; cyber-physical systems

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Iacovelli, S.; Kirner, R. A Lazy Bailout Approach for Dual-Criticality Systems on Uniprocessor Platforms. Designs 2019, 3, 10.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics



[Return to top]
Designs EISSN 2411-9660 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top