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

东北大学学报(自然科学版) ›› 2008, Vol. 29 ›› Issue (9): 1257-1261.DOI: -

• 论著 • 上一篇    下一篇

硬实时环境下固定优先级调度的离线优化

罗玎玎;赵海;孙佩刚;林恺;   

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

Off-line optimization of fixed priority scheduling in hard real-time environment

Luo, Ding-Ding (1); Zhao, Hai (1); Sun, Pei-Gang (1); Lin, Kai (1)   

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

RichHTML

1

PDF (PC)

763

摘要： RM调度算法具有简单的实现机制和较低的调度开销,被广泛应用于硬实时调度领域.然而这类算法的固定优先级特征使其在高任务负载环境下具有极高的抢占次数,从而导致了较大的系统开销,因此提出一种方法来减少RM调度的抢占次数.该方法通过离线计算任务集的最优属性来减少基于RM调度的系统在运行时的抢占次数,进而降低系统的抢占开销.仿真结果表明,该方法可以在不付出额外调度开销的前提下有效减少RM调度的抢占次数,降低实时系统的抢占开销.

关键词: 实时系统, 硬实时调度, 固定优先级, RM算法, 抢占开销

Abstract: The RM algorithm has widely been used in hard real-time environment, mainly due to its simple implementation mechanism and low scheduling overheads. However, the heavy system overheads resulting from the highly frequent occurrences of preemption under heavy workload are characterized by the fixed priority scheduling of the RM algorithm. So, a method is proposed to reduce the occurrences of preemption in running due to the scheduling by RM algorithm via optimizing the attribute by off-line computation of task set, thus reducing the relevant overheads. Simulation results show that the occurrences of preemption and relevant overheads in real-time systems can be reduced efficiently by the method proposed without extra scheduling overheads.

中图分类号: