Analysis of window-constrained execution time systems

被引:1
作者
Balbastre, Patricia [1 ]
Ripoll, Ismael [1 ]
Crespo, Alfons [1 ]
机构
[1] Univ Politecn Valencia, Dept Comp Engn, E-46071 Valencia, Spain
关键词
optional computation; fault tolerance; schedulability analysis; window-constrained system;
D O I
10.1007/s11241-006-9004-z
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Feasibility tests for hard real-time systems provide information about the schedulability of the task set. However, this information is a yes or a no answer, that is, whether the task set achieves the test or not. From the real-time system design point of view, having more information available would be useful. For example, how much the computation time can vary without jeopardising the system feasibility. This work specifically provides methods to determine off-line how much a task can increase its computation time, by maintaining the system feasibility under a dynamic priority scheduling. The extra time can be determined not only in all the task activations, but in n of a window of m invocations. This is what we call a window-constrained execution time system. The results presented in this work can be used in all kinds of real-time systems: fault tolerance management, imprecise computation, overrun handling, control applications, etc.
引用
收藏
页码:109 / 134
页数:26
相关论文
共 26 条
[1]   ADAPTIVE FEEDBACK-CONTROL [J].
ASTROM, KJ .
PROCEEDINGS OF THE IEEE, 1987, 75 (02) :185-217
[2]  
AUDSLEY N, 1993, THESIS U YORK UK
[3]  
Balbastre P., 2002, 14 EUR C REAL TIM SY
[4]  
BALBASTRE P, 2006, 18 EUR C REAL TIM SY
[5]  
BARUAH S, 1999, 6 C REAL TIM COMP SY, P62
[6]  
BARUAH SK, 1990, PROCEEDINGS : 11TH REAL-TIME SYSTEMS SYMPOSIUM, P182, DOI 10.1109/REAL.1990.128746
[7]  
BERNAT G, 1998, THESIS U ILLES BAL
[8]   ALGORITHM FOR COMPUTER CONTROL OF A DIGITAL PLOTTER [J].
BRESENHAM, JE .
IBM SYSTEMS JOURNAL, 1965, 4 (01) :25-30
[9]   ENGINEERING A HARD REAL-TIME SYSTEM - FROM THEORY TO PRACTICE [J].
BURNS, A ;
WELLINGS, AJ .
SOFTWARE-PRACTICE & EXPERIENCE, 1995, 25 (07) :705-726
[10]  
BURNS A, 1997, PROBABILISTIC GUARAN