摘要
速率单调(RM)调度和最早截止期限优先(EDF)调度在实时调度领域占有重要低位。基于一个x86体系结构的小系统上设计实现RM和EDF调度算法,并在不同的工作负载下,以任务截止期错失率作为衡量不同任务调度算法性能优劣的指标,对两种算法进行了性能分析和比较。在通常情况下,RM和EDF都可以保证任务成功调度,EDF算法可承受较多的工作负载。但是随着负载的增加,EDF算法性能急剧下降,到一定过载程度,EDF算法性能低于RM算法。
Rate-monotonic （RM） algorithm and earliest-deadline-first （EDF） algorithm play an important role in the field of real-time scheduling. RM and EDF schedulers were implemented on a small system of x86 architecture. What＇s more, under various independent workloads, the performance of the two classes of scheduling algorithms was compared by the criteria of deadlines missed ratio. In general, both algorithms can guarantee the execution of tasks, but EDF algorithm has more relaxed bound for CPU utilization. However, when the system is more and more overloaded, EDF performs worse quickly. And to a degree, the performance of EDF is clearly worse than the performance of RM.
出处
《计算机工程与设计》
CSCD
北大核心
2006年第1期117-119,123,共4页
Computer Engineering and Design
