The Improved Earliest Deadline First with Virtual Deadlines Mixed-Criticality Scheduling Algorithm
Xuejing Zhao, Yehua Wei, Wenjia Li · 2017
The current trend in embedded systems towards integrating multiple functionalities with different degrees of criticalities on a shared computing platform. The concept of mixed-criticality system has been presented and is becoming common in embedded systems. The scheduling problem for mixed-criticality systems has become a hot research topic. A algorithm called EDF-VD was proposed for mixed- criticality systems, it can make a better performance guarantee. In order to increase the number of schedulable tasks, an improved mixed-criticality scheduling algorithm based on EDF-VD is proposed. In the proposed algorithm, a probabilistic parameter is introduced to represent the probability that the execution time of high criticality task exceeding the worst execution time at its low criticality mode, and sufficient conditions that the mixed-criticality task instances can be scheduled are derived. Simulation results show that the number of schedulable tasks in the proposed algorithm is more than the EDF-VD algorithm.