Dynamic Scheduling for Real-time Multi-tasks Based on Dual Priority
Shumin Fei · Jisuanji gongcheng · 2005
A dual priority scheduling algorithm with aperiodic server is presented.It splits the range of priorities into three bands:high,middle and low band.At the beginning of the instance of the hard real-time task release,its priority is set in low band and is promoted to high band after a period of time.However the priority of the instance of the soft real-time task is only set in middle band.Finally,the priority promotion time of the hard real-time task and the schedulability are investigated.