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

自适应SR-RM调度算法 被引量：3

On the SR-RM Scheduling Algorithm
下载PDF
导出
摘要 在分析RM调度算法的基础上,提出了一种自适应SR RM调度算法,通过跟踪任务的实际执行情况以及处理器的繁忙程度自适应地调整任务的执行周期,使任务得到较合理的调度,达到理想的服务响应时间,以提高系统的实时性;同时监视和预测环境的变化是否造成不可调度任务集,通过自动调节任务的执行周期来减少不可调度任务集的发生,提高系统的可靠性·通过仿真实验,证明SR RM能得到较小的任务调度错失率、较高的可调度利用率和实时性能· Analyzing the advantages of RM(Rate Monotonic) scheduling algorithm and its disadvantages in actual execution, the SR-RM(Self-Regulating Rate Monotonic) scheduling algorithm is proposed to adjust the task execution period through tracking the actual execution time of assigned tasks and processor utilization. In addition, SR-RM engaged in decrease unscheduled task set to improve reliability through scout and predict environment transformation. Simulation tests revealed that SR-RM scheduling algorithm is available to the real-time implementation environment of reducing the miss rate of tasks with higher processor utilization.
作者 王小英 赵海 张文波 尹震宇
机构地区 东北大学信息科学与工程学院
出处 《东北大学学报（自然科学版）》 EI CAS CSCD 北大核心 2005年第5期425-428,共4页 Journal of Northeastern University(Natural Science)
基金 国家自然科学基金资助项目(60203011)
关键词 SR-RM调度 RM调度 自适应 实时系统 SR-RM scheduling RM scheduling self-regulating real-time system
分类号 TP316.2 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献10

  • 1Liu C L, Layland J W. Scheduling algorithms for multiprogramming in a hard-real-time environment [ J ].Journal of the ACM, 1973,30:47 - 61.
  • 2Audsley 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.
  • 3Lehoczky 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.
  • 4Seto 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.
  • 5Enrico 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.
  • 6Mahmoud 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.
  • 7Yoshifumi 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.
  • 8Wei 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.
  • 9Liu 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.
  • 10Lehoczky 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.

同被引文献24

  • 1Allcock W, Chervenak A, Foster I, et al. The data grid:towards an architecture for the distributed management and analysis of large scientific datasets[J].Journal of Network and Computer Applications, 2001,23(2):187-200.
  • 2You X D, Chang G R, Yang W, et al. Replica location mechanism based on DHT and the small-world theory[A].Third International Conference and GCC 2004 International Workshops[C].Wuhan, 2004.319-326.
  • 3Paranhos D, Cirne W,Brasileiro F. Trading cycles for information:using replication to schedule bag-of-tasks applications on computational grids[A].International Conference on Parallel and Distributed Computing (Euro-Par)[C].Klagenfurt, 2003.169-180.
  • 4Fujimoto H, Hagihara K. Near-optimal dynamic task scheduling of independent coarse-grained tasks onto a computational grid[A].Annual International Conference on Parallel Processing (ICPP-03)[C].Kaohsiung, 2003.391-398.
  • 5Fujimoto N, Hagihara K. A comparison among grid scheduling algorithms for independent coarse-grained tasks[A].2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)[C].Tokyo, 2004.674-680.
  • 6Robertazzi T G. Computer networks and systems[M].New York:Berlin Heidelberg, 2000.53-59.
  • 7Bernat G,Burns A,Liamosi A.Weakly hard real-time systems[J].IEEE Transactions on Computers,2001,50(4):308-321.
  • 8Bernat G.Specification and analysis of weakly hard real-time systems[D].Spain:Universitat de les Illes Balears,1998.
  • 9Gendy 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.
  • 10Hamdaoui 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.

引证文献3

二级引证文献7

东北大学学报（自然科学版）
2005年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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