期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一个基于RM的弱硬实时调度算法 被引量：3

A Weakly Hard Real-Time Scheduling Algorithm Based on RM
下载PDF
导出
摘要 在定义弱硬实时系统周期任务模型的基础上,提出基于RM调度策略的弱硬实时调度算法PV-RM.PV-RM调度算法在对任务的未来行为进行预测的基础上,通过将任务在抢占段和让步段之间切换,动态调整任务的优先级以反映紧迫程度.在系统过载时,PV-RM调度算法按照任务的初始优先级,为重要的任务提供满足其弱硬实时约束的服务,为其他任务提供尽力而为的服务.给出了PV-RM调度算法的可调度性分析及可调度判定不等式,并通过示例分析说明了该算法的有效性. 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 iudging inequation of the PV-RM are also presented, and thevalidity of the algorithm is illuminated by analyzing examples.
作者 赵明 赵海 张文波 孙佩刚
机构地区 东北大学信息科学与工程学院 沈阳炮兵学院计算机系
出处 《东北大学学报（自然科学版）》 EI CAS CSCD 北大核心 2006年第7期743-746,共4页 Journal of Northeastern University(Natural Science)
基金 国家火炬计划项目(2002EB010154) 国家高新技术研究发展计划项目(2001AA415320)
关键词 弱硬实时系统 调度算法 弱硬实时约束 抢占段 让步段 weakly hard systern scheduling algorithm weakly hard real-time restrietion preempt segment yield segment
分类号 TP316.2 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献11

  • 1Bernat G,Burns A,Liamosi A.Weakly hard real-time systems[J].IEEE Transactions on Computers,2001,50(4):308-321.
  • 2Bernat G.Specification and analysis of weakly hard real-time systems[D].Spain:Universitat de les Illes Balears,1998.
  • 3Gendy M A E,Bose A,Shin K G.Evolution of the Internet QoS and support for soft real-time applications[J].Proceeding of IEEE,2003,91(7):1086-1104.
  • 4Hamdaoui M,Ramanathan P.A dynamic priority assignment technique for streams with (m,k)-firm deadlines[J].IEEE Transactions on Computers,1995,44(4):1443-1451.
  • 5Buttazzo G,Spuri M,Sensini F.Value vs.deadline scheduling in overload conditions[A].Proceedings of 16th IEEE Real-Time Systems Symposium[C].Pisa:IEEE Computer Society Press,1995.90-99.
  • 6王小英,赵海,张文波,尹震宇.自适应SR-RM调度算法[J].东北大学学报（自然科学版）,2005,26(5):425-428. 被引量：3
  • 7West R,Zhang Y T,Schwan K,et al.Dynamic window-constrained scheduling of real-time streams in media servers[J].IEEE Transactions on Computers,2004,53(6):774-759.
  • 8Ramanathan P.Overload management in real-time control applications using (m,k)-firm guarantee[J].IEEE Transaction on Parallel and Distributed Systems(Special Issue on Dependable Real-Time Systems),1999,10(6):549-559.
  • 9Koren G,Shasha D.Skip-over:algorithms and complexity for overloaded system that allows skips[A].Proceedings of Real-Time Systems Symposium[C].Pisa:IEEE Computer Society Press,1995.110-117.
  • 10Liu C L,Layland J W.Scheduling algorithm for multiprogramming in a hard real-time environment[J].Journal of ACM,1973,20(1):46-61.

二级参考文献10

  • 1Enrico B, Girogio B, Giuseppe B. A hyperbolic bound for rate monotonic algorithm [ A ]. IEEE 13th Euromicro Conference on Real-Time Systems [ C ]. Delft: IEEE Communication Society, 2001.59 - 68.
  • 2Mahmoud N. A modified version of rate-monotonic scheduling algorithm and its efficiency assessment [ A ]. IEEE 7th International Workshop on Object-Oriented Real-Time Dependable Systems [ C ]. San Diego: IEEE Communication Society, 2002. 289 - 294.
  • 3Yoshifumi M, Shigemi A. A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks [ A ].IEEE 1st Real-Time Technology and Applications Symposium [C]. Chicago: IEEE Communication Society,1995. 212 - 219.
  • 4Wei K S, Jane W S L, Liu C L. Modified rate-monotonic algorithm for scheduling periodic jobs with deferred deadlines [J]. IEEE Transactions on Software Engineering, 1993,19(12) :1171 - 1179.
  • 5Liu S, Rajkumar R, Lehoczky J P. Priority inheritance protocols: an approach to real-time synchronisation [ J ].IEEE Transactions on Computers, 1990, 39 ( 9 ): 1175 -1185.
  • 6Lehoczky J P, Liu S, Strosnider J K. Enhancing aperiodic responsiveness in hard real-time environment[A]. IEEE 8th Real-Time Systems Symposium [ C ]. San Jose: IEEE Communication Society, 1987. 261 - 270.
  • 7Liu C L, Layland J W. Scheduling algorithms for multiprogramming in a hard-real-time environment [ J ].Journal of the ACM, 1973,30:47 - 61.
  • 8Audsley N C, Burns A, Richardson M, et al. Applying new scheduling theory to static priority preemptive scheduling[J ].Software Engineering Journal, 1993,8(5) :284 - 292.
  • 9Lehoczky J, Lui S, Ye D. The rate monotonic scheduling algorithm: exact characterization and average case behavior[A]. IEEE 9th Real-Time Systems Symposium[C]. Santa Monica: IEEE Communication Society, 1989. 166 - 171.
  • 10Seto D B, Leboczky J, Liu S. Task period selection and schedulability in real-time systems [ A ]. IEEE Real-Time Systems Symposium [C]. Madrid: IEEE Communication Society, 1998. 188- 199.

共引文献2

同被引文献45

  • 1邢群科,郝红卫,温天江.两种经典实时调度算法的研究与实现[J].计算机工程与设计,2006,27(1):117-119. 被引量：19
  • 2陈英革,王小英,赵海,尹震宇.任务调度过程中就绪队列的优化研究[J].系统仿真学报,2006,18(4):877-882. 被引量：9
  • 3刘建伟,王蕾,谭南林,焦风川,高小明.轨道车辆MVB通信网络的实时特性[J].中国铁道科学,2006,27(6):79-83. 被引量：16
  • 4Cheng M K. Real time systems: scheduling, analysis, and verification[M]. New York: a John Wiley & Sons, 2002:1 - 60.
  • 5Tan Y D, Mooney V. Timing analysis for preemptive multitasking real-time systems with caehes [ J ]. ACM Transactions on Embedded Computing Systems, 2007, 6 (1):7-10.
  • 6Ramaprasad H, Mudler F. Bounding preemption delay within data cache reference patterns for real-time tasks[C]// Proceedings of the 12th IEEE Real Time and Embedded Technology Symposium. New York: IEEE, 2006:71 - 80.
  • 7Ramaprasad H, Mueller F. Tightening the bounds on feasible preemption points [C]//Proceedings of the 27th IEEE International Real-Time Systems Symposium. LoS Alamitos: IEEE Computer Society, 2006 : 212 - 222.
  • 8Liu C L, Layland J W. Scheduling algorithms for multiprogranmling in a hard-real time environment [ J ]. Journal of the ACM, 1973,20 ( 1 ) : 46 - 61.
  • 9Lehoczky J P. Fixed priority scheduling of periodic task .sets with arbitrary deadlines [C]//Proceedings of the 1 hh Real- Time Systems Symposium. Los alamitos: IEEE Computer Society, 1990:201 - 209.
  • 10Hoczky J P, Sha L, Strosnider J. A periodic scheduling in a hard real-time environment [ C ]//Proceedings of 8th IEEE Rea-Time System Symposium. San Franeisco: IEEE Computer Society, 1987:261 - 270.

引证文献3

二级引证文献4

东北大学学报（自然科学版）
2006年 第7期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部