Mixed Critical Earliest Deadline First

Socci, Dario; Poplavko, Peter; Bensalem, Saddek; Bozga, Marius

doi:10.1109/ecrts.2013.20

Cited by 25 publications

(22 citation statements)

References 14 publications

(49 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A number of papers have considered the restricted problem of scheduling a finite set of mixed criticality jobs with criticality-dependent execution times on a single processor Park and Kim 2011;Socci et al 2013a;Gu et al 2013;Socci et al 2015b;.…”

Section: Single Processor Analysismentioning

confidence: 99%

A Survey of Research into Mixed Criticality Systems

2017

View full text Add to dashboard Cite

This survey covers research into mixed criticality systems that has been published since Vestal's seminal paper in 2007, up until the end of 2016. The survey is organised along the lines of the major research areas within this topic. These include single processor analysis (including fixed priority and EDF scheduling, shared resources and static and synchronous scheduling), multiprocessor analysis, realistic models, and systems issues. The survey also explores the relationship between research into mixed criticality systems and other topics such as hard and soft time constraints, fault tolerant scheduling, hierarchical scheduling, cyber physical systems, probabilistic real-time systems, and industrial safety standards. CCS Concepts: •Computer systems organization → Real-time system specification; •Software and its engineering → Real-time schedulability; Real-time systems software;

show abstract

Section: Single Processor Analysismentioning

confidence: 99%

A Survey of Research into Mixed Criticality Systems

2017

View full text Add to dashboard Cite

show abstract

“…Algorithms satisfying this restriction are called MC-scheduling (for "mixedcriticality scheduling") algorithms. Most of the algorithms such as OCBP [10]- [12] and MCEDF [13], [14] that have been developed for scheduling mixed-criticality instances, as well as algorithms such as EDF-VD [15], [16], AMC [17], and MC-Fluid [18], [19] that have been proposed for scheduling systems of mixed-criticality recurrent tasks, fall into this category.…”

Section: B Mixed-criticality Schedulability: a Classificationmentioning

confidence: 99%

Semi-Clairvoyance in Mixed-Criticality Scheduling

Agrawal

Baruah

Burns

2019

2019 IEEE Real-Time Systems Symposium (RTSS)

View full text Add to dashboard Cite

In the Vestal model of mixed-criticality systems, jobs are characterized by multiple different estimates of their actual, but unknown, worst-case execution time (WCET) parameters. Prior work on mixed-criticality scheduling theory assumes that the execution duration of a job is only revealed by actually executing the job through to completion. We consider a different *semi-clairvoyant* model here, in which it is assumed that upon arrival a job reveals which of its WCET parameters it will respect. We identify circumstances under which this is a reasonable model, and design and evaluate scheduling algorithms appropriate for this model. We show that such semi-clairvoyance yields a significant quantifiable benefit over non-clairvoyance, in terms of both the complexity of schedulability analysis and the speedup needed to ensure schedulability.

show abstract

“…Multi-Criticality Scheduling of Real-Time Tasks: Since [22] first proposed a formal model for mixed-criticality systems, researchers have studied scheduling sequential tasks on both single processor [23][24][25][26][27][28][29][30] and multiprocessor machines [31,32]. In Section II, we discussed the algorithms most relevant to our work that use virtual deadlines [14,15].…”

Section: Related Workmentioning

confidence: 99%

Mixed-Criticality Federated Scheduling for Parallel Real-Time Tasks

Ferry

Ahuja

et al. 2016

2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)

View full text Add to dashboard Cite

A mixed-criticality system comprises safety-critical and non-safety-critical tasks sharing a computational platform. Thus, different levels of assurance are required by different tasks in terms of real-time performance. In addition, as the computational demands of real-time tasks are increasing, tasks may require internal parallelism in order to complete within stringent deadlines. In this paper, we consider the problem of mixed-criticality scheduling of parallel real-time tasks and propose a novel mixed-criticality federated scheduling (MCFS) algorithm for parallel real-time tasks based on the directed acyclic graph model. MCFS is based on federated intuition for scheduling parallel real-time tasks. It strategically assigns cores and virtual deadlines to tasks in order to achieve good schedulability. We prove that MCFS provides a capacity augmentation bound of 3.67 for a dual-criticality system, which to our knowledge is the first such performance bound for parallel mixed-criticality tasks. For task sets with only high-utilization tasks (utilization ≥ 1), we show that dual-criticality and multi-criticality MCFS have capacity augmentation bounds of 3.41 and 3.73, respectively. We also present an implementation of an MCFS runtime system in Linux that supports parallel programs written in OpenMP. We conduct both numerical and empirical experiments to demonstrate the practicality of our MCFS approach.

show abstract

Mixed Critical Earliest Deadline First

Cited by 25 publications

References 14 publications

A Survey of Research into Mixed Criticality Systems

A Survey of Research into Mixed Criticality Systems

Semi-Clairvoyance in Mixed-Criticality Scheduling

Mixed-Criticality Federated Scheduling for Parallel Real-Time Tasks

Contact Info

Product

Resources

About