Task Migration and Scheduler for Mixed-Criticality Systems

Baik, Jeanseong; Lee, Jaewoo; Kang, Kyungtae

doi:10.3390/s22051926

Cited by 3 publications

(2 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Task dropping of low-critical tasks was used by Ranjbar et al (2020) to achieve fault tolerance and schedulability. Baik et al (2022) has applied EDF-VD on a multicore system to improve the schedulability of low-critical tasks. As EDF-VD is an improvised version of EDF is used for timing analysis using the proposed heuristic for task allocation.…”

Section: State-of-the-art Of Task Scheduling In MC Systemsmentioning

confidence: 99%

“…Boudjadar et al (2019) analyzed the MC schedulers and proposed a dynamic mode switch option by degrading the task periods of the low-critical tasks. The MC schedulers were analyzed by Baik et al (2022) to improve the schedulability of low-critical tasks. The major focus is on task migration cost, and the analysis of the schedulers is being done on the Linux kernel.…”

Section: Background Of Fault-tolerant Task Scheduling In Real-time Sy...mentioning

confidence: 99%

See 1 more Smart Citation

Utilization and criticality based fault-tolerant scheduling in multicore mixed critical systems

Godabole¹,

Bhole²

2023

IJPCC

View full text Add to dashboard Cite

Purpose The main purpose of the paper is timing analysis of mixed critical applications on the multicore system to identify an efficient task scheduling mechanism to achieve three main objectives improving schedulability, achieving reliability and minimizing the number of cores used. The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques. Design/methodology/approach The paper opted for a simulation-based study. The simulation of mixed critical applications, like air traffic control systems and synthetic workloads, is carried out using a litmus-real time testbed on an Ubuntu machine. The heuristic algorithms for task allocation based on utilization factors and task criticalities are proposed for partitioned approaches with multiple objectives. Findings Both partitioned earliest deadline first (EDF) with the utilization-based heuristic and EDF-virtual deadline (VD) with a criticality-based heuristic for allocation works well, as it schedules the air traffic system with a 98% success ratio (SR) using only three processor cores with transient faults being handled by the active backup of the tasks. With synthetic task loads, the proposed criticality-based heuristic works well with EDF-VD, as the SR is 94%. The validation of the proposed heuristic is done with a global and partitioned approach of scheduling, considering active backups to make the system reliable. There is an improvement in SR by 11% as compared to the global approach and a 17% improvement in comparison with the partitioned fixed-priority approach with only three processor cores being used. Research limitations/implications The simulations of mixed critical tasks are carried out on a real-time kernel based on Linux and are generalizable in Linux-based environments. Practical implications The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques. Originality/value This paper fulfills an identified need to have multi-objective task scheduling in a mixed critical system. The timing analysis helps to identify performance risks and assess alternative architectures used to achieve reliability in terms of transient faults.

show abstract

Section: State-of-the-art Of Task Scheduling In MC Systemsmentioning

confidence: 99%

Section: Background Of Fault-tolerant Task Scheduling In Real-time Sy...mentioning

confidence: 99%