| 嵌入式系统中断服务可靠性评估方法 |
| 崔凯, 王洁, 周宽久, 梁浩然, 潘杰, 李明楚 |
| 大连理工大学 软件学院, 嵌入式系统工程系, 大连 116620 |
| Reliability of interrupt services for embedded systems |
| CUI Kai, WANG Jie, ZHOU Kuanjiu, LIANG Haoran, PAN Jie, LI Mingchu |
| Department of Embedded Systems Engineering, School of Software Technology, Dalian University of Technology, Dalian 116620, China |
摘要:
| |||
| 摘要在资源受限的情况下，嵌入式软件在运行时其性能指标能否满足要求至关重要，在确定的目标前提下，对于已给定的参数配置，嵌入式系统的设计也是至关重要的。针对嵌入式系统内中断服务的随机性、实时性和并发性等特点，该文提出基于排队理论的嵌入式系统中断服务可靠性评估方法，并构建多级中断服务抢占优先权的排队模型，得出中断服务系统的性能评估指标。仿真实验结果表明：基于排队的中断服务方法符合嵌入式系统的动态可靠性评估，同时具有一定的普适性。 | |||
| 关键词 ：嵌入式软件,排队理论,抢占优先权,中断服务 | |||
| Abstract：In resource-constrained environments, the uses must evaluate whether the embedded software can meet the objectives. This paper presents an interrupt service reliability assessment method for embedded systems based on queuing theory that includes the effects of interrupt service randomness, real-time operations and concurrency. This queuing model includes the multilevel interrupt servicing preemptive priority and gives a performance evaluation index for interrupt servicing systems. The model gives a somewhat universal dynamic assessment of the reliability of embedded systems with a queuing interrupt servicing method. | |||
| Key words：embedded softwarequeuing theorypreemptive priorityinterrupt servicing | |||
| 收稿日期: 2016-01-24 出版日期: 2016-08-23 | |||
| |||
| 通讯作者:王洁(1979-),副教授,E-mail:wangjie1003@163.comE-mail: wangjie1003@163.com | |||
| 引用本文: |
| 崔凯, 王洁, 周宽久, 梁浩然, 潘杰, 李明楚. 嵌入式系统中断服务可靠性评估方法[J]. 清华大学学报（自然科学版）, 2016, 56(8): 878-884. CUI Kai, WANG Jie, ZHOU Kuanjiu, LIANG Haoran, PAN Jie, LI Mingchu. Reliability of interrupt services for embedded systems. Journal of Tsinghua University(Science and Technology), 2016, 56(8): 878-884. |
| 链接本文: |
| http://jst.tsinghuajournals.com/CN/10.16511/j.cnki.qhdxxb.2016.25.027或 http://jst.tsinghuajournals.com/CN/Y2016/V56/I8/878 |
图表:
 |
| 图1 嵌入式软件系统中断源的排队模型 |
 |
| 表1 目标参量定义 |
 |
| 图2 稳态概率矩阵R |
 |
| 图3 LS＝120排队模型与仿真结果对比 |
 |
| 图4LS＝40排队模型与仿真结果对比 |
 |
| 图5 LS＝120排队模型与仿真结果对比 |
 |
| 图6 LS＝40排队模型与仿真结果对比 |
参考文献:
| [1] Wolf W.High-performance Embedded Computing:Architecture,Applications,and Methodologies[M].Princeton:Princeton University Press,2006. [2] Kim K.(N,n)-preemptive priority queues[J].Performance Evaluation,2011,68(7):575-585. [3] 张文波,赵海,王小英,等.基于ARMLinux的EWS过载性能研究[J].通信学报,2005,26(8):87-92.ZHANG Wenbo,ZHAO Hai,WANG Xiaoying,et al.Research on performance analysis of overloaded EWS based on ARMLinux[J].Journal on Communications,2005,26(8):87-92.(in Chinese) [4] Sala K,El-Badawi K.Performance analysis and comparison of interrupt handling schemes in gigabit networks[J].Computer Communications,2007,30(17):3425-3441. [5] Weidlich R,Nussbaumer M,Hlavacs H.Optimizations towards consolidation or throughput for multi-thread software[C]//3rd International Symposium on Parallel Architectures,Algorithms and Programming.Dalian:IEEE Press,2010:161-165. [6] 牛云,谢拴勤,戴冠中,等.基于排队论和时间需求分析法的实时系统时间行为分析[J].计算机应用研究,2007,24(12):106-108,111.NIU Yun,XIE Shuanqin,DAI Guanzhong,et al.Real-time system temporal parameters analysis via queuing theory and time-demand analysis method[J].Application Research of Computer,2007,24(12):106-108,111.(in Chinese) [7] 陆传赉.排队论[M].北京:北京邮电大学出版社,2009.LU Chuanlai.Queue Theory[M].Beijing:Beijing University of Post and Telecommunications Press,2009.(in Chinese) [8] Douglas R,Mille R.Computation of steady-state probabilities for M/M/1 priority queues[J].Operations Research,1981,29(5):945-958. [9] Mishra S S,Yadav D K.Cost and profit analysis of markovian queuing system with two priority classes:A computational approach[J].International Journal of Applied Mathematics and Computer Sciences,2009,5(3):150-156. [10] Srinivas V,Rao S S,Kale B K.Estimation of measures in M/M/1 queue[J].Communications in Statistics Theory and Methods,2011,40(18):3327-3336. [11] Nasrallah W F.How pre-emptive priority affects completion rate in an M/M/1 queue with Poisson reneging[J].European Journal of Operational Research,2009,193(1):317-320. [12] Hanbali A A,Boxma O.Busy period analysis of the state dependent M/M/1/K queue[J].Operations Research Letters,2010,38(1):1-6. [13] Ross S M.Introduction to Probability Models[M].10th ed.Salt Lake City:Academic Press,2010. [14] Donald G,Carl M.Fundamentals of Queuing Theory[M].New Jersey:John Wiley & Sons,Inc,1998. [15] LIU Xiaoyan,ZHOU Kuanjiu,XI Fang.Design and implementation of simulation system based on sparc microprocessor[J].Computer Technology and Development,2010,20(1):147-151. [16] YAN Hui,SHEN Xueqin,LI Xing,et al.An improved ant algorithm for job scheduling in grid computing[C]//Machine Learning and Cybernetics,Proceedings of the 2005 International Conference on IEEE.Guangzhou:IEEE Press,2005,5:2957-2961. |
相关文章:
|
