Mixed-criticality scheduling in real-time multiprocessor systems

Author(s):  
Sergey Osmolovskiy ◽  
Ivan Fedorov ◽  
Vladimir Vinogradov ◽  
Ekaterina Ivanova ◽  
Daniil Shakurov
2020 ◽  
Vol 10 (19) ◽  
pp. 6702
Author(s):  
Eugenia Ana Capota ◽  
Cristina Sorina Stangaciu ◽  
Mihai Victor Micea ◽  
Daniel-Ioan Curiac

In mixed criticality systems (MCSs), the time-triggered scheduling approach focuses on a special case of safety-critical embedded applications which run in a time-triggered environment. Sometimes, for these types of MCSs, perfectly periodical (i.e., jitterless) scheduling for certain critical tasks is needed. In this paper, we propose FENP_MC (Fixed Execution Non-Preemptive Mixed Criticality), a real-time, table-driven, non-preemptive scheduling method specifically adapted to mixed criticality systems which guarantees jitterless execution in a mixed criticality time-triggered environment. We also provide a multiprocessor version, namely, P_FENP_MC (Partitioned Fixed Execution Non-Preemptive Mixed Criticality), using a partitioning heuristic. Feasibility tests are proposed for both uniprocessor and homogenous multiprocessor systems. An analysis of the algorithm performance is presented in terms of success ratio and scheduling jitter by comparing it against a time-triggered and an event-driven method in a non-preemptive context.


Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1515
Author(s):  
Hyeongboo Baek ◽  
Kilho Lee

Zero-laxity (ZL) and contention-free (CF) policies have received considerable attention owing to their simplicity and applicability to real-time systems equipped with symmetry multiprocessors. Recently, the ZL policy for mixed-criticality (MC) systems has been proposed and studied, but the applicability to and performance of the CF policy for MC systems have not been investigated yet. In this paper, we propose the CF policy (as a scheduling policy) for MC symmetry multiprocessor systems, referred to as the MC systems tailored CF policy (MC-CF), and a schedulability analysis in support thereof. We define the notion of contention-free slots for two different criticalities (of MC systems) of tasks, propose a technique to limit the amount to be utilized for each task by defining an upper bound, and subsequently explain the way in which the contention-free slots are systematically utilized to improve the schedulability of MC symmetry multiprocessor systems. Following this, we develop a deadline analysis (DA) for MC-CF. Using our experimental results under various environmental settings, we demonstrate that MC-CF can significantly improve the schedulability of fixed-priority scheduling.


2018 ◽  
Vol 29 (8) ◽  
pp. 1766-1779 ◽  
Author(s):  
Hyeongboo Baek ◽  
Namyong Jung ◽  
Hoon Sung Chwa ◽  
Insik Shin ◽  
Jinkyu Lee

2009 ◽  
Vol 20 (10) ◽  
pp. 2628-2636 ◽  
Author(s):  
Jian WANG ◽  
Jian-Ling SUN ◽  
Xin-Yu WANG ◽  
Shen-Kang WANG ◽  
Jun-Bo CHEN

Sign in / Sign up

Export Citation Format

Share Document