首页 | 官方网站   微博 | 高级检索  
     

基于双优先级的实时多任务动态调度
引用本文:刘怀,费树岷.基于双优先级的实时多任务动态调度[J].计算机工程,2005,31(18):16-18.
作者姓名:刘怀  费树岷
作者单位:1. 南京师范大学电气与电子工程学院,南京,210042
2. 东南大学自动化研究所,南京,210096
基金项目:南京师范大学科研基金资助项目(2003KZXXGQ2B88)
摘    要:提出了带有非周期服务器的双优先级调度算法.该算法将优先级带宽分为高带、中带和低带3部分.强实时任务实例到达后,优先级设置在低带,经过一段时间后将其优先级提升到高带;软实时任务的优先级设置在中带.分析了强实时任务实例优先级提升时间和任务集的可调度性.

关 键 词:双优先级调度算法  非周期服务器  任务实例丢失率  可调度性
文章编号:1000-3428(2005)18-0016-03
收稿时间:08 23 2004 12:00AM
修稿时间:2004-08-23

Dynamic Scheduling for Real-time Multi-tasks Based on Dual Priority
LIU Huai,Fei Shumin.Dynamic Scheduling for Real-time Multi-tasks Based on Dual Priority[J].Computer Engineering,2005,31(18):16-18.
Authors:LIU Huai  Fei Shumin
Affiliation:LIU Huai, FEI Shumin (1. School of Electrical
Abstract: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.
Keywords:Dual priority scheduling algorithm  Aperiodic server  Discarded instances ratio of soft real-time task  Schedulability
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号