期刊文献+

改进的DWCS算法及其在弱硬实时系统中的应用

Improved DWCS Algorithm and Its Application to Weakly Hard Real-Time Systems
在线阅读 下载PDF
导出
摘要 针对动态窗口约束调度算法中,单个任务到达调度处理节点时,系统存在着无效计算的缺点,本文提出了一个改进算法。该算法在保留原有算法优良性能的同时,能够降低计算复杂性,提高系统的性能。并证明了DWCS算法可以用于一般的弱硬实时系统中。 According to the drawback of DWCS,the algorithm will calculate lots of parameters which prove to be nothing when single task arrives at the node of scheduling.An improved algorithm is put forward to solve the problem,which can decrease the complexity of system and improve the performance of system while keeping other high performance of DWCS.It is proved that DWCS can also be used in popular weakly hard real-time systems.
出处 《广东海洋大学学报》 CAS 2010年第3期82-86,共5页 Journal of Guangdong Ocean University
基金 国家自然科学基金(60573159)
关键词 动态窗口约束调度 弱硬实时 约束规范 泊松流 DWCS weakly hard real-time constrain specification poison stream
  • 相关文献

参考文献10

  • 1West R, Schwan K, Poellabuer C. Scalable scheduling support for loss and delay constrained media streams[EB/OL].(1999)[2009-11-16]. http://doi.ieeecomputersociety.org/10.1109/RTTAS. 1999.777658.
  • 2West R, Zhang Y, Schwan K. Dynamic window-constrained scheduling of real-time streams in media servers[J]. IEEE transactions on computers, 2004, 53(6): 744-759.
  • 3Bemat G, Bums A, Llamosi A. Weakly hard real-time systems[J]. IEEE transactions on computers, 2001, 50(4): 308-321.
  • 4Hamdaoui M, Ramanathan P. A dynamic priority assignment technique for streams with (m,k)-firm deadlines[J]. IEEE transactions on computers, 1995, 44(12): 1 443-1 451.
  • 5Koren G, Shasha D. Skip-Over: algorithms and complexity for overloaded systems that allow skipsfEB/OL].(1995)[2009-11-16]. http : // doi.ieeecomputersociety.org/ 10.1109/REAL. 1995.495201.
  • 6Kyong Hoon K, Jong K. An energy-efficient FEC scheme for weakly hard real-time Communications in wireless networks[EB/OL]. (2006) [2009-11-16]. http://portal.acm.org/toc.cfm? id=SER1ES 10948&type= sefies&coll=GUIDE&dI=GUIDE&CFID=82927613&CFTOKEN= 42673255.
  • 7Zhuang 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.
  • 8Ming Z, Hai Z. A new fixed-Priority scheduling algoritlun with (m,k)-firm guarantee[EB/OL].(1995)[2009-11-26], http://doi.ieeecom putersociety, org/10. 1109/REAL. 1995.495201.
  • 9Li L, Tan Y. Analysis and improvement of scheduling algorithms based on (m,k)-firm constraint[EB/OL]. (2008) [2009-11-26]. http://icec-xplorc.icec.org/ic15/4731351/4731550/04731575.pdf?arnumber= 4731575.
  • 10谢建国,陈松乔,陈建二.VBR视频流磁盘I/O的平滑调度算法[J].小型微型计算机系统,2002,23(1):36-39. 被引量:5

二级参考文献9

  • 1[1]Pancha P,El Zarki M.MPEG coding for variable bit rate video transmission[J].IEEE Communication Magazine, 1994:32(5): 54~66.
  • 2[2]Feng W,Rexford J.Performance evaluation of smoothing algorithms for thetransmitting prerecorded VBR video[J].IEEE Trans. on Multimedia,1999:9,302~313.
  • 3[3]Zhang Z L,Kurose J,Salehi J,Towsley D.Smoothing,statistical multiplexing andcall admission control for stored video[J].IEEE J. Select. Areas Commun.,Aug.1997:Vol. 15,1148~1166.
  • 4[4]James D S,Zhi-Li Zhang,Jim K,Towsley D.Supporting stored video: reducing ratevariability and end-to-end resource requirements through optimal smoothing[J].IEEE/ACM Trans. on Networking, Aug. 1998 6(4):397~410.
  • 5[5]Zhang Junbiao,Hui J.Applying traffic smoothing techniques for quality of servicecontrol in VBR video transmission[J].Computer Communications,1998:21(4):375~389.
  • 6[6]Rexford J, Towsley D.Smoothing variable-bit-rate video in an internetwork[J].IEEE/ACM Trans. on Networking,1999:7(2):April. 202~215.
  • 7[7]Grossglauser M,Keshav S,and Tse D.RCBR:A simple and efficient service formultiple time-scale traffic[J].IEEE/ACM Trans. on Networking,1997:6(5):741~755.
  • 8[8]Chang E,Zakhor A.Cost analysis for VBR video servers[J].IEEE Multimedia 1996:3(4): 56~71.
  • 9[9]Marshall A W,Olkin I.Inequalities:theory of majorization and its applications[M].New York,Academic,1979.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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