东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2008, Vol. 29 ›› Issue (11): 1560-1563.DOI: -

• 论著 • 上一篇    下一篇

WebitOS中动态优先级调度机制及EDF算法的实现

赵海;周峰;罗玎玎;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2008-11-15 发布日期:2013-06-22
  • 通讯作者: Zhao, H.
  • 作者简介:-
  • 基金资助:
    国家火炬计划项目(2002EB010154)

Implementation of dynamic-priority scheduling algorithm and EDF algorithm in WebitOS

Zhao, Hai (1); Zhou, Feng (1); Luo, Ding-Ding (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2008-11-15 Published:2013-06-22
  • Contact: Zhao, H.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

635

摘要： 在实时系统中,相对于静态优先级调度机制而言,动态优先级调度机制因其可以为每个任务的各个作业设置不同的绝对时限而更好地反映了实时系统对于所调度的各个任务的时限要求.基于最早时限优先(earliest-deadline-first EDF)算法的高可调度利用率,在WebitOS实时操作系统中设计并实现了动态优先级调度机制,并且提出了一种早期丢弃规则.实验结果表明,该规则提高了EDF算法在超载情况下的整体调度性能.

关键词: EDF算法, 动态优先级调度, WebitOS, 早期丢弃规则, 实时系统

Abstract: Compared with the static-priority scheduling algorithms in real-time system, the dynamic-priority scheduling algorithms, which can set different deadlines for different jobs of each and every task to reflect the time constraint on tasks better. A dynamic-priority scheduling algorithm designed and implemented in the WebitOS real-time operating system on the basis of the high availability scheduling of earliest deadline first (EDF) algorithm with an early discarding rule specified for next job. Test results showed that the rule enhances the scheduling performance of the EDF algorithm as a whole under over-loaded condition.

中图分类号: