摘要
提出了带有非周期服务器的双优先级调度算法。该算法将优先级带宽分为高带、中带和低带3部分。强实时任务实例到达后,优先级设置在低带,经过一段时间后将其优先级提升到高带;软实时任务的优先级设置在中带。分析了强实时任务实例优先级提升时间和任务集的可调度性。
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.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2005年第18期16-18,共3页
Computer Engineering
基金
南京师范大学科研基金资助项目(2003KZXXGQ2B88)
关键词
双优先级调度算法
非周期服务器
任务实例丢失率
可调度性
Dual priority scheduling algorithm
Aperiodic server
Discarded instances ratio of soft real-time task
Schedulability