Evaluation and Improvement of Response Time Bounds for Real-Time Applications under Non-Preemptive Fixed Priority Scheduling
Identifieur interne : 006B42 ( Main/Merge ); précédent : 006B41; suivant : 006B43Evaluation and Improvement of Response Time Bounds for Real-Time Applications under Non-Preemptive Fixed Priority Scheduling
Auteurs : Anis Koubaa ; Ye-Qiong SongSource :
- International Journal of Production Research ; 2004.
English descriptors
- KwdEn :
Abstract
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 are based on the analysis of a deterministic majoring trajectory. The first one is issued from the result 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 (\? ;,\? ;)-bounded message flows. Both approaches could be used to evaluate the end to end delay bound in the industrial switched Ethernet (our target application) in which the main traffic is periodic with or without jitters. However, the use of either the worst-case trajectory or (\? ;,\? ;) trajectory produces overestimated delay bounds. Therefore, in order to minimize this overestimation, we propose in this paper 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 (\? ;,\? ;)-constrained model. We also proposed a hybrid method to reduce the upper bound given Network Calculus for a multi-hop network. Numerical studies show the advantage of our method for reducing the estimation of the buffering requirement in each network element.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003E85
- to stream Crin, to step Curation: 003E85
- to stream Crin, to step Checkpoint: 000667
Links to Exploration step
CRIN:koubaa04aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="499">Evaluation and Improvement of Response Time Bounds for Real-Time Applications under Non-Preemptive Fixed Priority Scheduling</title></titleStmt><publicationStmt><idno type="RBID">CRIN:koubaa04a</idno><date when="2004" year="2004">2004</date><idno type="wicri:Area/Crin/Corpus">003E85</idno><idno type="wicri:Area/Crin/Curation">003E85</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003E85</idno><idno type="wicri:Area/Crin/Checkpoint">000667</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000667</idno><idno type="wicri:Area/Main/Merge">006B42</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Evaluation and Improvement of Response Time Bounds for Real-Time Applications under Non-Preemptive Fixed Priority Scheduling</title><author><name sortKey="Koubaa, Anis" sort="Koubaa, Anis" uniqKey="Koubaa A" first="Anis" last="Koubaa">Anis Koubaa</name></author><author><name sortKey="Song, Ye Qiong" sort="Song, Ye Qiong" uniqKey="Song Y" first="Ye-Qiong" last="Song">Ye-Qiong Song</name></author></analytic><series><title level="j">International Journal of Production Research</title><imprint><date when="2004" type="published">2004</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Fixed Priority Scheduling</term><term>Network Calculus</term><term>Worst-case Response Time Analysis</term><term>burst</term><term>jtter</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2432">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 are based on the analysis of a deterministic majoring trajectory. The first one is issued from the result 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 (\? ;,\? ;)-bounded message flows. Both approaches could be used to evaluate the end to end delay bound in the industrial switched Ethernet (our target application) in which the main traffic is periodic with or without jitters. However, the use of either the worst-case trajectory or (\? ;,\? ;) trajectory produces overestimated delay bounds. Therefore, in order to minimize this overestimation, we propose in this paper 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 (\? ;,\? ;)-constrained model. We also proposed a hybrid method to reduce the upper bound given Network Calculus for a multi-hop network. Numerical studies show the advantage of our method for reducing the estimation of the buffering requirement in each network element.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006B42 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 006B42 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:koubaa04a
|texte= Evaluation and Improvement of Response Time Bounds for Real-Time Applications under Non-Preemptive Fixed Priority Scheduling
}}
| This area was generated with Dilib version V0.6.33. |  |