scholarly journals Load-based schedulability analysis of certifiable mixed-criticality systems

Author(s):  
Haohan Li ◽  
Sanjoy Baruah
2018 ◽  
Vol 28 (02) ◽  
pp. 1950029 ◽  
Author(s):  
Tiantian Li ◽  
Tianyu Zhang ◽  
Ge Yu ◽  
Yichuan Zhang ◽  
Jie Song

Fluid scheduling allows tasks to be allocated with fractional processing capacity, which significantly improves the schedulability performance. For dual-criticality systems (DCS), dual-rate fluid-based scheduling has been widely studied, e.g., the state-of-the-art approaches mixed-criticality fluid scheduling (MCF) and MC-Sort. However, most of the existing works on DCS either only focus on the schedulability analysis or minimize the energy consumption treating leakage power as a constant. To this end, this paper considers the effect of temperature on leakage power and proposes a thermal and power aware fluid scheduling strategy, referred to as thermal and energy aware (TA)-MCF which minimizes both the energy consumption and temperature, while ensuring a comparable schedulability ratio compared with the MCF and MC-Sort. Extensive experiments validate the efficiency of TA-MCF.


2017 ◽  
Vol 26 (10) ◽  
pp. 1750159 ◽  
Author(s):  
Biao Hu ◽  
Kai Huang ◽  
Gang Chen ◽  
Long Cheng ◽  
Dongkun Han ◽  
...  

The integration of mixed-critical tasks into a platform is an increasingly important trend in the design of real-time systems due to its efficient resource usage. With a growing variety of activation patterns considered in real-time systems, some of them capture arbitrary activation patterns. As a consequence, the existing scheduling approaches in mixed-criticality systems (MCs), which assume the sporadic tasks with implicit deadlines, have sometimes become inapplicable or are ineffective. In this paper, we extend the sporadically activated task model to the arbitrarily activated task model in MCs with the preemptive fixed-task-priority schedule. By using the event arrival curve to model task activations, we present the necessary and sufficient schedulability tests that are based on the well-established results from Real-Time Calculus. We propose to use the busy-window analysis to do the sufficient test because it has been shown to be tighter than the sufficient test of using Real-Time Calculus. According to our experimental results, for sporadic task sets, our proposed test can achieve the same performance as the state-of-the-art schedulability test. However, compared with the previous schedulability analysis of preemptive fixed-task-priority, our approaches can handle more general tasks with blocking, jitter, and arbitrary deadlines.


2014 ◽  
Vol 27 (4) ◽  
pp. 856-866 ◽  
Author(s):  
Yao Chen ◽  
Qiao Li ◽  
Zheng Li ◽  
Huagang Xiong

2018 ◽  
Vol 83 ◽  
pp. 57-74 ◽  
Author(s):  
Qingling Zhao ◽  
Zonghua Gu ◽  
Haibo Zeng ◽  
Nenggan Zheng

Sign in / Sign up

Export Citation Format

Share Document