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

东北大学学报(自然科学版) ›› 2006, Vol. 27 ›› Issue (7): 743-746.DOI: -

• 论著 • 上一篇    下一篇

一个基于RM的弱硬实时调度算法

赵明;赵海;张文波;孙佩刚;   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院;沈阳炮兵学院计算机系 辽宁沈阳110004;辽宁沈阳110004;辽宁沈阳110004;辽宁沈阳110162
  • 收稿日期:2013-06-23 修回日期:2013-06-23 出版日期:2006-07-15 发布日期:2013-06-23
  • 通讯作者: Zhao, M.
  • 作者简介:-
  • 基金资助:
    国家火炬计划项目(2002EB010154);;

A weakly hard real-time scheduling algorithm based on RM

Zhao, Ming (1); Zhao, Hai (1); Zhang, Wen-Bo (1); Sun, Pei-Gang (2)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; (2) Department of Computer, Shenyang Artillery Academy, Shenyang 110162, China
  • Received:2013-06-23 Revised:2013-06-23 Online:2006-07-15 Published:2013-06-23
  • Contact: Zhao, M.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

683

摘要： 在定义弱硬实时系统周期任务模型的基础上,提出基于RM调度策略的弱硬实时调度算法PV-RM.PV-RM调度算法在对任务的未来行为进行预测的基础上,通过将任务在抢占段和让步段之间切换,动态调整任务的优先级以反映紧迫程度.在系统过载时,PV-RM调度算法按照任务的初始优先级,为重要的任务提供满足其弱硬实时约束的服务,为其他任务提供尽力而为的服务.给出了PV-RM调度算法的可调度性分析及可调度判定不等式,并通过示例分析说明了该算法的有效性.

关键词: 弱硬实时系统, 调度算法, 弱硬实时约束, 抢占段, 让步段

Abstract: Defining the periodic task model for weakly hard system, the PV-RM scheduling algorithm is presented on the basis of RM scheduling policy. By virtue of predicting the future tasks, PV-RM can adjust dynamically the priority of task by switching over its running state between P segment and Y segment in accordance to urgency. Once the tasks overload the system, PV-RM will provide the more important tasks having higher initial priority with the service to satisfy their weakly hard real-time restriction, and provide best-effort service to other tasks having lower initial priority. Schedulability analysis and schedulable judging inequation of the PV-RM are also presented, and the validity of the algorithm is illuminated by analyzing examples.

中图分类号: