计算机应用 ›› 2010, Vol. 30 ›› Issue (10): 2735-2737.

• 软件过程技术与先进计算 • 上一篇    下一篇

多处理器全局单调比率的可调度性分析

石林勇1,晏立2   

  1. 1. 江苏省镇江市江苏大学
    2. 江苏大学
  • 收稿日期:2010-04-14 修回日期:2010-06-09 发布日期:2010-09-21 出版日期:2010-10-01
  • 通讯作者: 石林勇

Schedulability analysis of global rate-monotonic scheduling algorithms on multiprocessor platforms

  • Received:2010-04-14 Revised:2010-06-09 Online:2010-09-21 Published:2010-10-01

摘要: 针对全局单调比率(RM)调度的多处理器系统中最高优先级任务数量少于处理器数量时,Bertogna等给出的最坏情况计算任务受到的干涉过于悲观,证明了任务受到最高优先级任务的干涉不会出现最坏情况,它受到非最高优先级任务干涉仍可能出现最坏情况。分析得出了任务受到最高优先级任务干涉的最大可能值,由此得到了一个更紧的可调度性判断条件。实验结果表明,提出的方法提高了判为可调度的任务集数量。

关键词: 实时系统, 多处理器, 全局调度, 可调度性分析, 干涉

Abstract: In the Rate-Monotonic (RM) global scheduling for multi-processor system, when the highest-priority task is fewer than the number of processors, the worst-case calculation interference given by Bertogna is too pessimistic. The authors proved that the interference of the task with highest priority on a task was not so pessimistic. But the interference of the task without highest priority on a task may be as pessimistic as the worst case presented by Bertogna, et al. The possible maximum interference of the tasks with highest priority was given by analysis, and then a tighter schedulability policy was put forward. The experimental results show that the proposed schedulability policy increases the amount of detected task set.

Key words: real-time system, multiprocessor, global scheduling, schedulability analysis, interference

中图分类号: