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

基于调度窗口的弱硬实时系统改进DBP调度算法研究 被引量：2

Research on W-DBP with weakly hard real-time systems based on scheduling window
下载PDF
导出
摘要 针对弱硬实时系统中平滑调度的要求,首先阐述基于调度窗口的弱硬实时约束规范,然后在传统的DBP算法基础上提出W-DBP算法,实现系统的平滑调度.W-DBP算法有效解决了传统DBP算法中存在的公平性和瞬时过载等问题.仿真对比试验和分析表明:W-DBP算法在弱硬实时系统中有良好的表现. To meet the demand of smooth scheduling in weakly hard real-time system,the authors firstly expounded a constraint specification based on the window of schedule,and then put forward a W-DBP scheduling algorithm based on traditional DBP to achieve smooth scheduling.The W-DBP algorithm could efficiently solve the problems of fair scheduling and transient overloading that existed in traditional DBP.Simulated analysis and results showed that W-DBP algorithm had a better performance in weakly hard real-time systems.
作者 朱旭东 常会友 衣杨 张健
机构地区 广东海洋大学信息学院 中山大学信息科学与技术学院
出处 《安徽大学学报（自然科学版）》 CAS 北大核心 2010年第4期70-75,共6页 Journal of Anhui University(Natural Science Edition)
基金 国家自然科学基金资助项目(60573159) 广东海洋大学教育教学改革项目(XJG200818)
关键词 弱硬实时系统 窗口距离优先 平滑调度 约束规范 weakly hard real-time system window-distance based priority smooth scheduling constraint specification
分类号 TP316 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献15

  • 1Hamdaoui M P,Ramanathan A.A dynamic priority assignment technique for streams with (m,k)-firm deadlines[J].IEEE Transaction on Computers,1995,44(12):1443-1451.
  • 2Bernat G,Burns A,Llamosi A.Weakly hard real-time systems[J].IEEE Transaction on Computers,2001,50(4):308-321.
  • 3谢建国,陈松乔,陈建二.VBR视频流磁盘I/O的平滑调度算法[J].小型微型计算机系统,2002,23(1):36-39. 被引量：5
  • 4Kyong H K,Jong K.An Energy-efficient FEC scheme for weakly hard real-time communications in wireless networks[C].Proceedings of the 12th.IEEE International Conference on Embedded and Real-Time Computing Systems and Applications,2006:415-419.
  • 5Zhuang S,Cassandras C G.Optimal control of discrete event systems with weakly hard real-time constraints[J].Discrete Event Dynamic Systems,2009,19(1):67-89.
  • 6West R,Schwan K,Poellabuer C.Scalable scheduling support for loss and delay constrained media streams[C].Real-Time Technology and Applications Symposium,Proceedings of the Fifth IEEE,1999:24-33.
  • 7West R.Dynamic window-constrained scheduling of real-time streams in media servers[J].IEEE Transaction on Computers,2004,53(6):744-759.
  • 8Ming Z,Hai Z.A new fixed-priority scheduling algorithm with(m,k)-firm guarantee[C].Electronic Computer Technology,2009 International Conference on,2009:92-95.
  • 9Li L,Tan Y.Analysis and improvement of scheduling algorithms based on (m,k)-firm constraint[C].Computer Science and Computational Technology,ISCSCT '08,International Symposium on,2008:74-77.
  • 10吴彤,金士尧,陈积明.弱硬实时系统任意窗口约束调度研究[J].电子学报,2008,36(8):1564-1570. 被引量：5

二级参考文献35

  • 1王永吉,陈秋萍.单调速率及其扩展算法的可调度性判定[J].软件学报,2004,15(6):799-814. 被引量：50
  • 2陈积明,宋叶琼,孙优贤.弱硬实时系统约束规范[J].软件学报,2006,17(12):2601-2608. 被引量：11
  • 3Hamdaoui M, Ramanathan P. A dynamic priority assignment technique for streams with (m, k)-firm deadlines[J ]. IEEE Trans. On Computers, 1995,44(4) : 1443-1451.
  • 4Bernat G. Specification and analysis of weakly hard real-time system [D]. University of York, 1998.
  • 5Bernat G, Burns A, Llamosi A. Weakly hard real time systems [J]. IEEE Trans. on Computers,2001,50(4) :308-321.
  • 6Li Lanying, Tan Yu. Analysis and improvement of scheduling algorithms based on (m, k)-firm constraint[C]//2008 International Symposium on Computer Science and Computational Technology: 74-77.
  • 7West R, Sehwan K, Poellabauer C. Sealable scheduling support for loss and delay constrained media streams[C] //Proc. of the 5th IEEE Real-Time Technology and Applications Symp. IEEE Computer Society Press, 1999 : 24-35.
  • 8Hamdaoui M,Ramanathan P. A service policy for real-time customers with (m, k)-firm deadlines[C]//Proceedings of 24th International Symposium on Fault Tolerant Computing. July 1994:196-205.
  • 9Hamdaoui M, Ramanathan P. A dynamic priority assignment technique for streams with (m, k)-firm deadlines[J]. IEEE transaction on Computers, 1995,44 (4) : 1443-1451.
  • 10West R. Adaptive Real-Time management of Communication and Computation Resources[D]. College of Computing, Georgia Institute of Technology, Aug. 2000.

共引文献15

同被引文献28

  • 1涂刚,阳富民,卢炎生.基于至少连续满足弱硬实时限制的调度算法[J].小型微型计算机系统,2006,27(7):1300-1303. 被引量：2
  • 2陈积明,宋叶琼,孙优贤.弱硬实时系统约束规范[J].软件学报,2006,17(12):2601-2608. 被引量：11
  • 3Hamdaoui 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.
  • 4Bernat G. Specification and analysis of weakly hard real-time system[D]. University ofYork,I998.
  • 5Bernat G, Bums A, Llamosi A. Weakly hard real-time systems [J]. IEEE Transactions on Computers,2001 ,50(4) :308-321.
  • 6Li L, Tan Y. Analysis and improvement of scheduling algorithms based on (m, k) -firm constraint [C]. International Symposium on Computer Science and Computational Technology, 2008:74-77.
  • 7West R, Schwan K, Poellabauer C. Scalable scheduling support for loss and delay constrained media streams [A]. In: Proc. of the 5th IEEE Real-Time Technology and Applications Symp [C], IEEE Computer Society Press ,1999 :24-35.
  • 8Zhu Xu-dong, Chang Hui-you , Yi Yang, et al. Research on W-DBP with weakly bard real-time system s based on scheduling window[J].Journal of Anhui University ( Natural Science Edition) ,2010, 34(4) :70-75.
  • 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,I995:110- 117.
  • 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.

引证文献2

二级引证文献1

安徽大学学报（自然科学版）
2010年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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