计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (13): 37-39.DOI: 10.3778/j.issn.1002-8331.2010.13.011

• 研究、探讨 • 上一篇    下一篇

m,p1)约束规范的动态调度算法研究

朱旭东1,2,常会友2,衣 杨2   

  1. 1.广东海洋大学 信息学院,广东 湛江 524088
    2.中山大学 信息科学与技术学院,广州 510006
  • 收稿日期:2009-10-22 修回日期:2009-12-07 出版日期:2010-05-01 发布日期:2010-05-01
  • 通讯作者: 朱旭东

Research on dynamic scheduling algorithm of weak hardly real-time based on (mp1

ZHU Xu-dong1,2,CHANG Hui-you2,YI Yang2   

  1. 1.School of Information,Guangdong Ocean University,Zhanjiang,Guangdong 524088,China
    2.School of Information Science and Technology,Sun Yat-sen University,Guangzhou 510006,China
  • Received:2009-10-22 Revised:2009-12-07 Online:2010-05-01 Published:2010-05-01
  • Contact: ZHU Xu-dong

摘要: m,p1)有效解决了µ-pattern中第一个数字为0时部分约束规范失效的问题。在弱硬实时调度算法研究的基础上,针对(m,p1)约束规范,提出了一个动态弱硬实时调度算法,分析与仿真结果表明,算法效果良好。

关键词: 弱硬实时, m, p1), 动态调度算法, 约束规范

Abstract: The constrain specification of (m,p1) effectively solves the problem that some other constrain specifications fail when the first number in µ-pattern is zero.After research and analysis of weakly hard real-time scheduling algorithm,this paper puts forward a new dynamic scheduling algorithm based on(m,p1).And the analysis and simulation suggest that the new scheduling algorithm works well.

Key words: weakly hard real-time, m, p1), dynamic scheduling algorithm, constrain specification

中图分类号: