摘要
在研究基于(m,k)模型的窗口限制实时系统的基础上,提出了一种受〈m,k〉限制的窗口限制实时系统.首先对该实时系统的调度性进行了分析与研究,得出了一些结论.然后提出了一种新的动态窗口调度算法,该算法充分利用了〈m,k〉限制的特点来提高实时任务的可调度性,减少窗口限制违例.同时,还进行了大量的模拟研究,这些模拟以传统的动态窗口调度算法为基准,将其应用于受〈m,k〉限制的窗口限制实时系统时的窗口限制违例情况并与新算法进行比较.模拟结果表明,新算法的表现优于传统的动态窗口限制的调度算法.最后进行了总结与展望.
Based on the research of window-constrained real-time system with (m, k ) constraints, a window-constrained real-time system with (m,k) constraints is proposed. Firstly, the system is analyzed and some conclusions about the schedulability of this system are obtained. In succession, a new dynamic windows-constrained scheduling, which uses the characteristic of (m, k) to improve the schedulability of this system, is proposed. To evaluate the performance of the new algorithm, extensive simulation studies are carried out. These simulations apply the dynamic window-constrained scheduling (DWCS) algorithm to schedule the window-constrained real-time system with (m, k) constraints and use it as a baseline to compare with the proposed algorithm. Simulation results show that the new algorithm is better than the old DWCS algorithm. Finally, the future research directions are discussed.
出处
《计算机研究与发展》
EI
CSCD
北大核心
2005年第8期1445-1451,共7页
Journal of Computer Research and Development
基金
国家"八六三"高技术研究发展计划基金项目(2003AA1Z1120)
关键词
实时调度
调度算法
周期任务
实时系统
real-time scheduling
scheduling algorithms
periodic tasks
real-time systems