A New RTA Based Scheduling Algorithm for Mixed-Criticality Systems

2013 ◽  
Author(s):  
Long Li ◽  
Renfa Li ◽  
Lida Huang ◽  
Renfei Wu ◽  
Lining Zeng
Keyword(s):  
Scheduling Algorithm ◽  
Mixed Criticality

Evaluation of Two Mixed-Criticality Scheduling Algorithm for Periodic Tasks

2014 ◽  
Vol 513-517 ◽  
pp. 1160-1164
Author(s):  
Shu Juan Huang ◽  
Yi An Zhu
Keyword(s):  
Scheduling Algorithm ◽  
The Other ◽  
Earliest Deadline First ◽  
Periodic Tasks ◽  
System Utilization ◽  
Simulation Results ◽  
Earliest Deadline ◽  
Better Than ◽  
Mixed Criticality

Nowadays, there are two approach in mixed-criticality scheduling. One is reservations-based approach such as EDF-VD(Earliest Deadline First-Virtual Deadline) and the Other is priority-based scheduling such as OCBP(Own Criticality Based Priority). This paper compared the two mixed-criticality scheduling algorithm from three aspects. The simulation results show that EDF-VD is better than OCBP in completed tasks and the system utilization, but in unmissed deadline ratio the later owns the better.

Sign in / Sign up

Export Citation Format

Share Document