MC-Fluid: Multi-Core Fluid-Based Mixed-Criticality Scheduling

A Smart Semipartitioned Real‐Time Scheduling Strategy for Mixed‐Criticality Systems in 6G‐Based Edge Computing

“…In the original Vestal model, LO-criticality jobs sometimes are treated the same as noncritical jobs that will be not guaranteed in HI-criticality system mode, which ensures the completion requirements of HI-criticality tasks. Nevertheless, from the engineering perspective, LO-criticality task is not an NO-criticality task; it cannot be dropped easily [22][23][24][25][26]. Su and Zhu firstly focus on the LO-criticality tasks dropped in mixed critical scheduling and discuss the feasibility of restarting LO-criticality tasks from a multimodal perspective [22].…”

“…Firstly, LO-criticality levels are not noncritical, and dropping the executing LOcriticality tasks may damage the system's acceptance rate. During the scheduling process, the processors could be so idle that they can be assigned to perform LO-criticality tasks and thereby improving system utilization and task acceptance [25,26].…”

Multi-core mixed-criticality real-time scheduling

“…Thus, the first step would be to determine a discrete multi-rate algorithm that allows both discrete-time mode switches and discrete-time executions. In the recent past, a similar discretetime algorithm has been developed for the dual-rate fluid model [66]. However, there is a certain loss in schedulability performance for such a discrete-time algorithm.…”

“…In Chapter 3, Section 3.2.1, we discussed several global MC algorithms [26,28,29,66,78] designed for scheduling dual-criticality MC systems on homogenous multi-core platforms. However, most of these algorithms have poor schedulability performance as discussed in Section 1.3.…”

“…Ramanathan and Easwaran[78] presented different rate assignment strategies that have better performance than MCF and has lower computational complexity than MC-Fluid. Recently, Lee et al[66] presented a technique to convert a MC-Fluid schedule to a non-fluid schedule with minimal loss in performance. Although these algorithms are known to be dual-rate and/or speed-up optimal, there are several feasible dual-criticality task systems that are deemed not schedulable by them.…”