Safety Schedule Algorithm Based on Mixed Priority
Xiaoguang Fan · Jisuanji gongcheng · 2010
To improve the safety of real-time system at transient overload,a schedule algorithm based on mixed priority is proposed.The priority of the algorithm consists of relative deadline priority and relative slack priority.With relative slack,whether tasks will miss deadline can be predicted.Through the complete CPU preemption,frequent context switch can be avoided.Simulation results show that the presented algorithm improves the efficiency of task schedule and effectively decreases the Missed Deadline Percentage(MDP) at transient overload.