Traffic shaping in real-time distributed systems: a low-complexity approach
Identifieur interne : 00AF62 ( Main/Merge ); précédent : 00AF61; suivant : 00AF63Traffic shaping in real-time distributed systems: a low-complexity approach
Auteurs : B. Gaujal [France] ; N. Navet [France]Source :
- Computer Communications [ 0140-3664 ] ; 1999.
Descripteurs français
- Wicri :
- topic : Réseau local.
English descriptors
- KwdEn :
- Teeft :
- Algorithm, Allocation process, Allocation rule, Aperiodic, Aperiodic frames, Aperiodic messages, Aperiodic task scheduling, Asap, Asap policy, Asap strategy, Average response time, Communication controller level, Computer science, Constraint, Control engineering practice, Controller area network, Deadline, Deadline failure probability, Density sequence, Desynchronized, Desynchronized case, Desynchronized stations, Different performance objectives, Dual priority scheduling, Elsevier science, Engine controller, Factory instrumentation protocol, Feasibility, Full system, Gaujal, Higher priority, Higher priority messages, Jitter, Latter case, Message latencies, Message scheduling, Mode changes, Navet, Navet computer communications, Network load, Node, Periodic frame, Periodic message, Periodic messages, Probabilistic guarantees, Protocol, Release time, Response time, Response times, Scheduling, Second assertion, Second objective, Selection procedure, Selection process, Selection slots, Slot, Stochastic process, Such buses, Technical report, Time granularity, Time slot, Time unit, Timing requirements, Total network load, Transmission errors, Transmission request, Transmission time, Unreliable transmission, Uptm, Variance.
Abstract
Abstract: In real-time systems, one generally identifies two types of timing requirements, hard and soft constraints. In this study, it is assumed that the Hard Real-Time traffic (HRT) is periodic with deadlines that must be guaranteed, while the Soft Real-Time traffic (SRT) is aperiodic with timing constraints that could occasionally be missed without major consequences. In this paper, the problem of scheduling these two types of traffic with different performance objectives will be addressed: (1) ensure that the timing requirements of HRT traffic are met; (2) minimize as much as possible the response time of SRT traffic while satisfying (1). For this purpose, we propose an easily implementable and low-complexity traffic shaping policy, which preserves feasibility and improves response times for SRT traffic. The underlying idea is that it is possible to diminish the response time of SRT traffic if the busy periods induced by the HRT traffic are “harmoniously” distributed over time, creating time intervals during which the resource (i.e. the processor or the medium) can be used by SRT traffic with minimum delay. A computer-implementable algorithm that has to be executed independently on each node of the bus is also provided, as well as several extensions of the original model.
Url:
DOI: 10.1016/S0140-3664(99)00149-8
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000A53
- to stream Istex, to step Curation: 000A47
- to stream Istex, to step Checkpoint: 002296
Links to Exploration step
ISTEX:2D20BB65FB145FADF8AD20022A49E5DA1D1EF50FLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Traffic shaping in real-time distributed systems: a low-complexity approach</title><author><name sortKey="Gaujal, B" sort="Gaujal, B" uniqKey="Gaujal B" first="B." last="Gaujal">B. Gaujal</name></author><author><name sortKey="Navet, N" sort="Navet, N" uniqKey="Navet N" first="N." last="Navet">N. Navet</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:2D20BB65FB145FADF8AD20022A49E5DA1D1EF50F</idno><date when="1999" year="1999">1999</date><idno type="doi">10.1016/S0140-3664(99)00149-8</idno><idno type="url">https://api.istex.fr/ark:/67375/6H6-1BV2ZLR1-0/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000A53</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000A53</idno><idno type="wicri:Area/Istex/Curation">000A47</idno><idno type="wicri:Area/Istex/Checkpoint">002296</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002296</idno><idno type="wicri:doubleKey">0140-3664:1999:Gaujal B:traffic:shaping:in</idno><idno type="wicri:Area/Main/Merge">00AF62</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Traffic shaping in real-time distributed systems: a low-complexity approach</title><author><name sortKey="Gaujal, B" sort="Gaujal, B" uniqKey="Gaujal B" first="B." last="Gaujal">B. Gaujal</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA-INPL, ENSEM-2, Avenue de la forêt de Haye, F-54516 Vandoeuvre-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Navet, N" sort="Navet, N" uniqKey="Navet N" first="N." last="Navet">N. Navet</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA-INPL, ENSEM-2, Avenue de la forêt de Haye, F-54516 Vandoeuvre-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Computer Communications</title><title level="j" type="abbrev">COMCOM</title><idno type="ISSN">0140-3664</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1999">1999</date><biblScope unit="volume">22</biblScope><biblScope unit="issue">17</biblScope><biblScope unit="page" from="1562">1562</biblScope><biblScope unit="page" to="1573">1573</biblScope></imprint><idno type="ISSN">0140-3664</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0140-3664</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Local area network</term><term>Real-time systems</term><term>Scheduling algorithm</term><term>Traffic shaping</term></keywords><keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term><term>Allocation process</term><term>Allocation rule</term><term>Aperiodic</term><term>Aperiodic frames</term><term>Aperiodic messages</term><term>Aperiodic task scheduling</term><term>Asap</term><term>Asap policy</term><term>Asap strategy</term><term>Average response time</term><term>Communication controller level</term><term>Computer science</term><term>Constraint</term><term>Control engineering practice</term><term>Controller area network</term><term>Deadline</term><term>Deadline failure probability</term><term>Density sequence</term><term>Desynchronized</term><term>Desynchronized case</term><term>Desynchronized stations</term><term>Different performance objectives</term><term>Dual priority scheduling</term><term>Elsevier science</term><term>Engine controller</term><term>Factory instrumentation protocol</term><term>Feasibility</term><term>Full system</term><term>Gaujal</term><term>Higher priority</term><term>Higher priority messages</term><term>Jitter</term><term>Latter case</term><term>Message latencies</term><term>Message scheduling</term><term>Mode changes</term><term>Navet</term><term>Navet computer communications</term><term>Network load</term><term>Node</term><term>Periodic frame</term><term>Periodic message</term><term>Periodic messages</term><term>Probabilistic guarantees</term><term>Protocol</term><term>Release time</term><term>Response time</term><term>Response times</term><term>Scheduling</term><term>Second assertion</term><term>Second objective</term><term>Selection procedure</term><term>Selection process</term><term>Selection slots</term><term>Slot</term><term>Stochastic process</term><term>Such buses</term><term>Technical report</term><term>Time granularity</term><term>Time slot</term><term>Time unit</term><term>Timing requirements</term><term>Total network load</term><term>Transmission errors</term><term>Transmission request</term><term>Transmission time</term><term>Unreliable transmission</term><term>Uptm</term><term>Variance</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Réseau local</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In real-time systems, one generally identifies two types of timing requirements, hard and soft constraints. In this study, it is assumed that the Hard Real-Time traffic (HRT) is periodic with deadlines that must be guaranteed, while the Soft Real-Time traffic (SRT) is aperiodic with timing constraints that could occasionally be missed without major consequences. In this paper, the problem of scheduling these two types of traffic with different performance objectives will be addressed: (1) ensure that the timing requirements of HRT traffic are met; (2) minimize as much as possible the response time of SRT traffic while satisfying (1). For this purpose, we propose an easily implementable and low-complexity traffic shaping policy, which preserves feasibility and improves response times for SRT traffic. The underlying idea is that it is possible to diminish the response time of SRT traffic if the busy periods induced by the HRT traffic are “harmoniously” distributed over time, creating time intervals during which the resource (i.e. the processor or the medium) can be used by SRT traffic with minimum delay. A computer-implementable algorithm that has to be executed independently on each node of the bus is also provided, as well as several extensions of the original model.</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 00AF62 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00AF62 | 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é= ISTEX:2D20BB65FB145FADF8AD20022A49E5DA1D1EF50F
|texte= Traffic shaping in real-time distributed systems: a low-complexity approach
}}
| This area was generated with Dilib version V0.6.33. |  |