Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling

被引:26
作者
Koubaa, A [1 ]
Song, YQ [1 ]
机构
[1] Univ Nancy 1, INPL, LORIA, F-54506 Vandoeuvre Les Nancy, France
关键词
D O I
10.1080/00207540410001705211
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Real-time applications must be guaranteed with a bounded response time. The two main approaches for computing the upper bounds are worst-case schedulability analysis and Network Calculus, both of which are based on the analysis of a deterministic majoring trajectory. The first approach is issued from the results of Liu and Layland and gives what is called the worst-case response time for a given set of periodic tasks scheduled with fixed priority. The second approach, proposed by Cruz, gives an upper bound on delay for a set of (sigma, rho)-ounded message flows. Both approaches could be used to evaluate the end-to-end delay bound in the industrial switched Ethernet (the target application) in which the main traffic is periodic with or without jitters. However, the use of either the worst-case trajectory or (sigma, rho) trajectory produces overestimated delay bounds. Therefore, to minimize this overestimation, the paper proposes a comparative study of the delay bounds evaluated by both approaches for periodic (with or without jitters) arrival processes under Fixed Priority Scheduling. For this purpose, a relationship is given between jitter and the maximum burst size for an optimal transposition from the classical task model to the (sigma, rho)-constrained model. The paper also proposes a hybrid method to reduce the upper bound given Network Calculus for a multihop network. Numerical studies show the advantage of the method for reducing the estimation of the buffering requirement in each network element.
引用
收藏
页码:2899 / 2913
页数:15
相关论文
共 19 条
[1]   APPLYING NEW SCHEDULING THEORY TO STATIC PRIORITY PREEMPTIVE SCHEDULING [J].
AUDSLEY, N ;
BURNS, A ;
RICHARDSON, M ;
TINDELL, K ;
WELLINGS, AJ .
SOFTWARE ENGINEERING JOURNAL, 1993, 8 (05) :284-292
[2]  
BRIAND P, 1999, M DEADLINES HARD REA
[3]  
BURNS A, 1993, P WORKSH PAR DISTR R, P11
[4]  
Chang C.-S., 2000, TELEC NETW COMP SYST
[5]   A CALCULUS FOR NETWORK DELAY .2. NETWORK ANALYSIS [J].
CRUZ, RL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (01) :132-141
[6]   A CALCULUS FOR NETWORK DELAY .1. NETWORK ELEMENTS IN ISOLATION [J].
CRUZ, RL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (01) :114-131
[7]  
GEORGES JP, 2002, IEEE INT WORKSH FACT
[8]  
GEORGES L, 2000, RR3926 INRIA
[9]  
HANSSON H, 1997, IEEE INT WORKSH FACT
[10]  
HLADIK PE, 2003, RTS2003, P307