Dual Priority Schedule Algorithm for Real-time Multi-processor System
Nan Ding · Jisuanji gongcheng · 2011
This paper presents a real-time task schedule algorithm based on dual priority for the homogeneous multi-processor system.Aiming at the character of sporadic tasks,the algorithm pretests the sporadic tasks and further improves the success rate of sporadic tasks schedule.The simulation results show that when the multi-core processor system utilization is at the limit,the algorithm is still able to schedule the hard real-time periodic tasks successfully and ensure the high success schedule rate of soft real-time periodic tasks and sporadic tasks.