utilization bound for periodic task set with composite deadline

	utilization bound for periodic task set with composite deadline
	Min-Allah Nasro ; Ali Ishtiaq ; Xing Jiansheng ; Wang Yongji
刊名	Computers and Electrical Engineering
	2010
卷号	36 期号:6 页码:1101-1109
关键词	Online systems Polynomial approximation Response time (computer systems) Scheduling Testing
ISSN号	457906
学科主题	Computer Science ; Hardware & Architecture; Computer Science ; Interdisciplinary Applications; Engineering ; Electrical & Electronic
WOS记录号	WOS:000284340200009
公开日期	2011-05-24
附注	Due to polynomial time complexity, utilization based tests are desired for online feasibility analysis of periodic task systems. However, the associated disadvantage with these tests is that they propose a bound on system utilization, which trade processor utilization for performance. On the contrary, response time based tests share pseudo-polynomial time complexity, which are very expensive in terms of analysis time and therefore, impractical for analyzing feasibility of online systems. Realizing the advantage of utilization based tests over response time tests, attempts are being made to propose utilization based exact tests that achieve 100% CPU utilization for the system by modifying task parameters such as restricting task periods to be harmonic. We show that in systems where task deadlines are large, better results are obtained by making the task deadlines harmonic. The paper proposes a novel solution to feasibility problem of periodic task system under the assumption of composite deadline by providing a utilization based exact test with an upper bound of 1 and complexity O(n). © 2010 Elsevier Ltd. All rights reserved.
内容类型	期刊论文
源URL	[http://124.16.136.157/handle/311060/10139]
专题	软件研究所_互联网软件技术实验室 _期刊论文
推荐引用方式 GB/T 7714	Min-Allah Nasro,Ali Ishtiaq,Xing Jiansheng,et al. utilization bound for periodic task set with composite deadline[J]. Computers and Electrical Engineering,2010,36(6):1101-1109.
APA	Min-Allah Nasro,Ali Ishtiaq,Xing Jiansheng,&Wang Yongji.(2010).utilization bound for periodic task set with composite deadline.Computers and Electrical Engineering,36(6),1101-1109.
MLA	Min-Allah Nasro,et al."utilization bound for periodic task set with composite deadline".Computers and Electrical Engineering 36.6(2010):1101-1109.