Task Migration and Scheduler for Mixed-Criticality Systems

Abstract

The interference between software components is increasing in safety-critical domains, such as autonomous driving. Low-criticality (LC) tasks, such as vehicle communication, may control high-criticality (HC) tasks, such as acceleration. In such cases, the LC task should also be considered as an HC task because the HC tasks relies on the LC task. However, the difficulty in guaranteeing these LC tasks is the catastrophic cost of computing resources, the electronic control unit in the domain of vehicles, required for every task. In this paper, we theoretically and practically provide safety-guaranteed and inexpensive scheduling for LC tasks by borrowing the computational power of neighbored systems in distributed systems, obviating the need for additional hardware components. As a result, our approach extended the schedulability of LC tasks without violating the HC tasks. Based on the deadline test, the compatibility of our approach with the task-level MC scheduler was higher than that of the system-level MC scheduler, such that the task-level had all dropped LC tasks recovered while the system-level only had 25.5% recovery. Conversely, from the worst-case measurement of violated HC tasks, the HC tasks were violated by the task-level MC scheduler more often than by the system-level MC scheduler, with 70.3% and 15.4% average response time overhead, respectively. In conclusion, under the condition that the HC task ratio has lower than 47% of the overall task systems at 80% of total utilization, the task-level approach with task migration has extensively higher sustainability on LC tasks.

Keywords

• real-time systems
• vehicle safety
• scheduling algorithms
• mixed-criticality
• task migration
• system implementation