期刊文献+

基于CPN的μC/OS系统实时性能分析 被引量:4

Research on performance analysis of μC/OS real-time system based on CPN
在线阅读 下载PDF
导出
摘要 仿真并分析了μC/OS系统固定优先级调度系统,指出当前的静态分析方法无法评估具体实时性能指标的局限性。提出使用CPN(赋时着色Petri网)对μC/OS实时系统中任务调度机制建模,包括系统各子任务之间的依赖关系、各任务的实限要求以及固定优先级调度机制,并通过运行模型来获取系统的具体实时性能指标。实验结果表明,基于动态仿真获取的性能数据,可指导优化系统中各任务的优先级设计,从而提高系统的实时性能。 Priority-fixed scheduling system of μC/OS system is simulated and analyzed, and the limitation of the static method used to practical real-time performance analysis is pointed out. To address this problem, modeling technique for the real-time system with priority-fixed scheduling based on timed color Petri net is proposed, which can quickly model real-time tasks creating and scheduling mechanism. The experimental results show that through simulating Petri net model of real-time system, priority design of real-time task set based on system's practical real-time performance index is evaluated and optimized.
出处 《计算机工程与设计》 CSCD 北大核心 2009年第8期1994-1997,共4页 Computer Engineering and Design
关键词 μC/OS系统 任务优先级 赋时着色PETRI网 性能分析 仿真 μC/OS system task priority timed ColouredPetri net (CPN) performance analysis simulation
  • 相关文献

参考文献8

  • 1Jean J Labrosse.μC/OS Ⅱ嵌入式实时操作系统[M].北京:北京航空航天出版社,2003.
  • 2Jensen K.Coloured Petri nets-basic concepts,analysis methods and practical use[Z].
  • 3邢建生,刘军祥,王永吉.RM及其扩展可调度性判定算法性能分析[J].计算机研究与发展,2005,42(11):2025-2032. 被引量:6
  • 4George Lima,Alan Bums.Scheduling fixed-priority hard realtime tasks in the presence of faults[C].LADC,2005:154-173.
  • 5Bcrnat G,Colion A,Petters S M.WCET analysis of probabilistic hard real-time systems[C].Proc of the 23rd IEEE Real-time Systems Symposium(RTSS02),2002:279-288.
  • 6Maxiaguine A,Kunzli S,Thiele L.Workload characterization model for tasks with variable execution demand[C].Proe of the 7th Design,Automation and Test in Europe,2004.
  • 7Wells L.Performance analysis using coioured petri nets[C].Proc of the 10th IEEE International Symposium on Modeling,Analysis,and Simulation of Computer and Telecommunications Systems(MASCOTS'02),2002.
  • 8袁崇义.Petri网原理[M].北京:电子工业出版社,2005.213—259.

二级参考文献10

  • 1王永吉,陈秋萍.单调速率及其扩展算法的可调度性判定[J].软件学报,2004,15(6):799-814. 被引量:50
  • 2刘军祥,王永吉,Matthew Cartmell.一种改进的RM可调度性判定算法[J].软件学报,2005,16(1):89-100. 被引量:16
  • 3C. L. Liu, J. W. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 1973, 20(1): 46~61.
  • 4A. Burchard, J. Liebeherr, Y. Oh, et al. New strategies for assigning real-time tasks to multiprocessor systems. IEEE Trans.Computers, 1995, 44(12): 1429~1442.
  • 5E. Bini, G. C. Buttazzo, G. Buttazzo. A hyperbolic bound for the rate monotonic algorithm. In: IEEE Proc. 13th Euromicro Conf. Real-Time Systems. Oakland: IEEE Computer Society Press, 2001. 59~68.
  • 6J. P. Lehoczky, L. Sha, Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In: Proc. 10th IEEE Real-Time Systems Symposium.Oakland: IEEE Computer Society Press, 1989. 166~171.
  • 7E. Bini, G. C. Buttazzo. The space of rate monotonic schedulability. In: Proc. 23rd IEEE Real-Time Systems Symposium. Oakland: IEEE Computer Society Press, 2002. 169~ 178.
  • 8C.C. Han, H. Y. Tyan. A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithm. In: Proc.18th IEEE Real-Time Systems Symposium. Oakland: IEEE Computer Society Press, 1997. 36~45.
  • 9D.I. Katcher, H. Arakawa, J. K. Strosnider. Engineering and analysis of fixed priority schedulers. IEEE Trans. Software Engineering, 1993, 19(9): 920~934.
  • 10J. B. Goodenough, L. Sha. The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks.ACM SIGAda Ada Letters, 1988, 8(7): 20~31.

共引文献24

同被引文献23

引证文献4

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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