期刊文献+

基于path RTL的弱硬实时系统

Novel Weakly Hard Real-time System Based on Path RTL
下载PDF
导出
摘要 弱硬实时系统是实时系统中的一个重要研究领域.经典弱硬实时系统以任务流中任务满足或错过的个数来约束系统性能,存在着无法准确表达系统实时特性的不足,以及弱硬实时的可靠性无法证明的缺陷.通过提出弹性截止期的概念,定义基于path RTL的弱硬实时系统,有效解决了经典弱硬实时系统可靠性无法证明的难题;实现了弱硬实时系统的约束由时间特性来表达的目标;对于新兴出现的弱硬实时应用提供了完整的解决方案;同时也对经典弱硬实时系统提出了规约算法,以充分利用经典弱硬实时系统在约束规范、调度算法等方面已有研究成果.通过比较,path RTL弱硬实时系统在系统完整性、系统可靠性和应用领域等方面,比经典弱硬实时系统具有优势. Weakly hard real-time system has become increasingly important in the research of real-time system.However,classic weakly hard real-time system fails to show its advantage of real-time performance with the constraint by the number of tasks meeting or missing the deadline and has an obvious defect that the reliability of it can not be proved.With the concept of "flexible deadline",this paper puts forward a novel weakly hard real-time system based on path RTL,which can efficiently solve the problem that the reliability of classic weakly real-time system can not be proved,and implement the constraint of weakly hard real-time with time-depended arguments.The novel weakly hard real-time also provides solutions for the newly emerged applications of weakly hard real-time systems.Moreover,a procedure is proposed to term the classic weakly hard real-time system so as to make the best of its existing research achievements in constraint specification and scheduling algorithm.The result shows that as compared with classic weakly real-time system,the new weakly hard real-time system based on path RTL has a better performance in system integrity,reliability and application fields.
出处 《小型微型计算机系统》 CSCD 北大核心 2012年第8期1862-1867,共6页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61033010)资助
关键词 弱硬实时系统 PATH RTL 弹性截止期 规约 weakly hard real-time system path RTL flexible deadlines term
  • 相关文献

参考文献23

  • 1Mok A K,Tsou D C,R C M de Rooij. The MSP. RTL real time scheduler synthesis tool [C]. Proc. 17th IEEE Real-Time Systems Symp. ,1996: 118-128.
  • 2Jahanian F, Mok A. Safety analysis of timing properties in realtime systems [J]. IEEE Transactions on Software Engineering, 1986,12 (9) :890-904.
  • 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.
  • 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.
  • 5Li 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.
  • 6Andrei S, Cheng A M K. Efficient verification and optimization of real-time logic-specified systems[J]. IEEE Transactions on Computers,2009,58(12) :1640-1653.
  • 7Jahanian F, Mok A. A graph-theoretic approach for timing analysis and its implementation [J]. IEEE Transactions on Computers, 1987,36(8) :961-975.
  • 8Bernat G. Specification and analysis of weakly hard real-time system[D]. University ofYork,I998.
  • 9Wang F, Mok A K. RTL and refutation by positive cysles[A]. Proc. Formal Methods Europe Symp [C], IEEE Computer Society Press, 1994 :659-680.
  • 10赵明,赵海,张文波,张浩华,罗桂兰,孙佩刚.针对弱硬实时系统的DRM调度算法[J].电子学报,2008,36(1):70-75. 被引量:1

二级参考文献58

  • 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.

共引文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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