Semi-partitioned scheduling of mixed-criticality system on multiprocessor platforms

Yang, Canghai; Wang, Han; Zhang, Ji; Zuo, Li

doi:10.1007/s11227-021-04101-y

Cited by 2 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 31 shows that if the ratio between Ci(HI) and Ci(LO) increases, the task set schedulability decreases, because if the 𝑅 𝐻𝐼 between Ci(HI) and Ci(LO) increases, it multiplies the utilization of a given task set, which decreases the task sets schedulability. The proposed technique performs better than MC-EKG-VD-1 [9], CB-FP [18], global and partitioned techniques in terms of high utilization of task sets due to increasing value of parameter 𝑅 𝐻𝐼 .…”

Section: B Results Analysismentioning

confidence: 99%

“…This research work is one of the initial research works that reduces the overhead caused by context switches and migrations of tasks in cluster-based MC systems. This research work performs better as compared to clusterbased fixed priority (CB-FP) [8], MC-EKG-VD-1 [9] global and partitioned scheduling approaches.…”

Section: Introductionmentioning

confidence: 89%

“…The experiments are evaluated on mixed-criticality task sets of MC systems. We compared the proposed approach with other multicore scheduling approaches i.e., CB-FP [18], MC-EKG-VD-1 [9], partitioned and global approaches to show the effectiveness of our approach. The same time of context switch and migration overhead of MC-Bfair approach is considered for CB-FP and MC-EKG-VD-1 approach.…”

Section: Experimental Evaluationmentioning

confidence: 99%

See 2 more Smart Citations

Overhead Based Cluster Scheduling of Mixed Criticality Systems on Multicore Platform

Ali,

Khattak,

Iqbal

et al. 2023

IEEE Access

View full text Add to dashboard Cite

The cluster-based technique is gaining focus for scheduling tasks of mixed-criticality (MC) real-time multicore systems. In this technique, the cores of the MC system are distributed in groups known as clusters. When all cores are distributed in clusters, the tasks are partitioned into clusters, which are scheduled on the cores within each cluster using a global approach. In this study, a cluster-based technique is adopted for scheduling tasks of real-time mixed-criticality systems (MCS). The Decreasing Criticality Decreasing Utilization with the worst-fit (DCDU-WF) technique is used for partitioning of tasks to clusters, whereas a novel mixed-criticality cluster-based boundary fair (MC-Bfair) scheduling approach is used for scheduling tasks on cores within clusters. The MC-Bfair scheduling algorithm reduces the number context switches and migration of tasks, which minimizes the overhead of mixed-criticality tasks. The migration and context switch overhead time is added at the time of each migration and context switch respectively for a task. In low critical mode, the low mode context switch and migration overhead time is added to task execution time, while the high mode overhead time of migration and context switch is added to the execution time of a task in high critical mode. The results obtained from experiments show the better schedulablity performance of proposed cluster-based technique as compared to cluster-based fixed priority (CB-FP), MC-EKG-VD-1, global and partitioned scheduling techniques e.g., for target utilization U=0.6, the proposed technique schedule 66.7% task sets while MC-EKG-VD-1, CB-FP, partitioned and global techniques schedule 50%, 33.3%, 16.7% and 0% task sets respectively.

show abstract

Section: B Results Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 89%

Section: Experimental Evaluationmentioning

confidence: 99%

See 1 more Smart Citation