Reliability of interrupt services for embedded systems

doi:10.16511/j.cnki.qhdxxb.2016.25.027

Download: PDF(1181 KB)
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

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.

Keywords embedded software queuing theory preemptive priority interrupt servicing

ZTFLH:

TP302

Issue Date: 15 August 2016

	Service

	E-mail this article
	E-mail Alert
	RSS
	Articles by authors

	CUI Kai
	WANG Jie
	ZHOU Kuanjiu
	LIANG Haoran
	PAN Jie
	LI Mingchu

Cite this article:

CUI Kai,WANG Jie,ZHOU Kuanjiu, et al. Reliability of interrupt services for embedded systems[J]. Journal of Tsinghua University(Science and Technology), 2016, 56(8): 878-884.

URL:

http://jst.tsinghuajournals.com/EN/10.16511/j.cnki.qhdxxb.2016.25.027 OR http://jst.tsinghuajournals.com/EN/Y2016/V56/I8/878

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