Equivalent Matrix DBP for Streams with (m,k) - Firm Deadline
Identifieur interne : 003F25 ( Crin/Curation ); précédent : 003F24; suivant : 003F26Equivalent Matrix DBP for Streams with (m,k) - Firm Deadline
Auteurs : Jiming Chen ; Yeqiong Song ; Zhi Wang ; Youxian SunSource :
English descriptors
- KwdEn :
Abstract
A real-time message stream is said to have an (m,k)-firm requirement if at least m out of any k consecutive messages from the stream must meet their deadline to ensure adequate quality of service (QoS). A scheduling policy is proposed recently called Distance-Based Priority (DBP) to better service multiple input queues single server (MIQSS) model, each stream with (m,k)-firm. But DBP cannot always provide good performance in MIQSS model. The raison is that DBP assignment is only based on the distance to failure state of each individual message stream with (m,k)-firm. Neither the message timing parameters (period, deadline, service time in server) nor its relationship with other streams sharing the same server is taken into account. Song et al proposed a modification of DBP called matrix-DBP to improve its performance. But this improved policy just only applies to periodic source. In this paper, we propose a new policy referred to equivalent matrix (E_Matrix) DBP for aperiodic streams by considering the above factor. The effectiveness of this proposal is evaluated through simulation under varying service rate in Poisson streams with same and different (m,k)-firm constraints. The evaluation shows that substantial reductions in the probability of dynamic failure for overall system are achieved when the proposed policy is used.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003F25
Links to Exploration step
CRIN:chen04bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="143">Equivalent Matrix DBP for Streams with (m,k) - Firm Deadline</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:chen04b</idno>
<date when="2004" year="2004">2004</date>
<idno type="wicri:Area/Crin/Corpus">003F25</idno>
<idno type="wicri:Area/Crin/Curation">003F25</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003F25</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Equivalent Matrix DBP for Streams with (m,k) - Firm Deadline</title>
<author><name sortKey="Chen, Jiming" sort="Chen, Jiming" uniqKey="Chen J" first="Jiming" last="Chen">Jiming Chen</name>
</author>
<author><name sortKey="Song, Yeqiong" sort="Song, Yeqiong" uniqKey="Song Y" first="Yeqiong" last="Song">Yeqiong Song</name>
</author>
<author><name sortKey="Wang, Zhi" sort="Wang, Zhi" uniqKey="Wang Z" first="Zhi" last="Wang">Zhi Wang</name>
</author>
<author><name sortKey="Sun, Youxian" sort="Sun, Youxian" uniqKey="Sun Y" first="Youxian" last="Sun">Youxian Sun</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>(m</term>
<term>dbp</term>
<term>dynamic failure</term>
<term>k)-firm</term>
<term>performance evaluation</term>
<term>qos</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="2332">A real-time message stream is said to have an (m,k)-firm requirement if at least m out of any k consecutive messages from the stream must meet their deadline to ensure adequate quality of service (QoS). A scheduling policy is proposed recently called Distance-Based Priority (DBP) to better service multiple input queues single server (MIQSS) model, each stream with (m,k)-firm. But DBP cannot always provide good performance in MIQSS model. The raison is that DBP assignment is only based on the distance to failure state of each individual message stream with (m,k)-firm. Neither the message timing parameters (period, deadline, service time in server) nor its relationship with other streams sharing the same server is taken into account. Song et al proposed a modification of DBP called matrix-DBP to improve its performance. But this improved policy just only applies to periodic source. In this paper, we propose a new policy referred to equivalent matrix (E_Matrix) DBP for aperiodic streams by considering the above factor. The effectiveness of this proposal is evaluated through simulation under varying service rate in Poisson streams with same and different (m,k)-firm constraints. The evaluation shows that substantial reductions in the probability of dynamic failure for overall system are achieved when the proposed policy is used.</div>
</front>
</TEI>
<BibTex type="inproceedings"><ref>chen04b</ref>
<crinnumber>A04-R-241</crinnumber>
<category>3</category>
<equipe>NLICT</equipe>
<author><e>Chen, Jiming</e>
<e>Song, YeQiong</e>
<e>Wang, Zhi</e>
<e>Sun, Youxian</e>
</author>
<title>Equivalent Matrix DBP for Streams with (m,k) - Firm Deadline</title>
<booktitle>{2004 IEEE International Symposium on Industrial Electronics - ISIE 2004, Ajaccio, France}</booktitle>
<year>2004</year>
<pages>675-680</pages>
<month>may</month>
<publisher>IEEE</publisher>
<keywords><e>(m</e>
<e>k)-firm</e>
<e>dynamic failure</e>
<e>qos</e>
<e>dbp</e>
<e>performance evaluation</e>
</keywords>
<abstract>A real-time message stream is said to have an (m,k)-firm requirement if at least m out of any k consecutive messages from the stream must meet their deadline to ensure adequate quality of service (QoS). A scheduling policy is proposed recently called Distance-Based Priority (DBP) to better service multiple input queues single server (MIQSS) model, each stream with (m,k)-firm. But DBP cannot always provide good performance in MIQSS model. The raison is that DBP assignment is only based on the distance to failure state of each individual message stream with (m,k)-firm. Neither the message timing parameters (period, deadline, service time in server) nor its relationship with other streams sharing the same server is taken into account. Song et al proposed a modification of DBP called matrix-DBP to improve its performance. But this improved policy just only applies to periodic source. In this paper, we propose a new policy referred to equivalent matrix (E_Matrix) DBP for aperiodic streams by considering the above factor. The effectiveness of this proposal is evaluated through simulation under varying service rate in Poisson streams with same and different (m,k)-firm constraints. The evaluation shows that substantial reductions in the probability of dynamic failure for overall system are achieved when the proposed policy is used.</abstract>
</BibTex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003F25 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 003F25 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Crin |étape= Curation |type= RBID |clé= CRIN:chen04b |texte= Equivalent Matrix DBP for Streams with (m,k) - Firm Deadline }}
This area was generated with Dilib version V0.6.33. |