摘要
针对单处理器实时系统动态调度问题进行了研究,分析任务的到达时间、执行时间、截止时间和空闲时间等任务属性的敏感度和影响度,提出了一种基于优先级表的调度算法PTBM,使相对截止期越小、空闲时间越大的任务优先级越高。对关于实时任务属性敏感度和影响度的结论验证和与传统的EDF、LLF和PTD算法的对比进行仿真实验,仿真结果表明基于优先级表设计的实时调度算法PTBM具有较高的调度成功率。该方法可应用于实时系统的实时任务的动态调度中。
Focused on dynamic scheduling of single-processor real-time system, this paper defined and analyzed the sensitivity and influence of task attributes including arrival time, execution time, deadline and laxity, then it proposed a scheduling algo- rithm PTBM based on priority table, which made that a task with small deadline and large laxity had higher priority. Compared with PTBM with EDF, LLF and PTD, simulated results verify CMRN of the sensitivity and influence, and show PTBM outper- forming on scheduling success ratio. The proposed algorithm can be applied to dynamically schedule real-time tasks in real- time systems.
出处
《计算机应用研究》
CSCD
北大核心
2014年第5期1410-1413,共4页
Application Research of Computers
关键词
实时系统
动态调度
任务属性
敏感度
影响度
优先级表
调度成功率
real-time system
dynamic scheduling
task attributes
sensitivity
influence
priority table
scheduling successratio
