A schedulability analysis of tasks and network traffic in distributed real-time systems
Identifieur interne : 00C657 ( Main/Exploration ); précédent : 00C656; suivant : 00C658A schedulability analysis of tasks and network traffic in distributed real-time systems
Auteurs : Carlos Cardeira [France] ; Zoubir Mammeri [France]Source :
- Measurement [ 0263-2241 ] ; 1995.
English descriptors
- Teeft :
- Algorithm, Algorithm execution time, Allocation constraints, Application timing constraints, Arbitrator, Arbitrator station, Arbitrator turnaround time, Cardeira, Central controller, Centralized systems, Certain cost, Classical devices, Communication load, Communication systems, Comput, Computation time, Computer science, Configuration tool, Constraint, Different networks, Digital information, Elementary network, Execution time, Fault tolerance, Fieldbus, Fieldbus traffic, Flow control, Global scheduling, Global scheduling algorithms, Global task scheduling, Hard systems, Hardware costs, Ieee, Ieee trans, Incremental tasks, Inevitable noise, International standards organization, Internetworking devices, Large number, Main idea, Mammeri, Message scheduling, Message transmission, Monoprocessor, Monoprocessor task scheduling, Multiprocessor, Multiprocessor scheduling, Multiprocessor task scheduling, Network traffic, Neural networks, Node, Optimization criteria, Optimization criterion, Other words, Overall goal, Physical layer specifications, Physical medium, Physical process, Physical support, Precedence constraints, Preemption, Preemptive, Preemptive algorithms, Processing capabilities, Processor, Protocol, Real time systems, Resource constraints, Same time, Sampling table, Schedulability analysis, Schedule length, Schedule tasks, Scheduling, Scheduling algorithm, Scheduling algorithms, Scheduling point, Scheduling tasks, Scheduling viewpoint, Session layer, Single processor, Software, Software engineering, Standard fieldbus, Task execution, Task execution time, Task migration, Task scheduling, Task scheduling algorithms, Temporal aspects, Temporal validity, Time window, Timing constraints, Traffic scheduling, Trans, Transmission time, Transmission times, Transport layer.
Abstract
Abstract: In real-time systems the deadlines of each task must be met. A pre-run-time schedulability analysis becomes necessary to prove that the existing software and target hardware will meet the real-time application constraints. In a real-time distributed system, the messages transmitted through the network are also time constrained. However, some new problems arise when one applies existing task scheduling algorithms to schedule the network traffic. The main goal of this paper is to define the boundaries between these two domains of scheduling. After an introduction to fieldbuses and real-time systems, we present an equivalence between tasks and messages as well as between processors and networks, which are much different in practice but have strong similarities from the scheduling point of view. Finally, we analyse the new constraints introduced by the presence of smart transducers/transmitters in fieldbus applications and we define the scheduling algorithms adapted for this type of applications.
Url:
DOI: 10.1016/0263-2241(94)00039-A
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001269
- to stream Istex, to step Curation: 001252
- to stream Istex, to step Checkpoint: 002A72
- to stream Main, to step Merge: 00CF14
- to stream Main, to step Curation: 00C657
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>A schedulability analysis of tasks and network traffic in distributed real-time systems</title><author><name sortKey="Cardeira, Carlos" sort="Cardeira, Carlos" uniqKey="Cardeira C" first="Carlos" last="Cardeira">Carlos Cardeira</name></author><author><name sortKey="Mammeri, Zoubir" sort="Mammeri, Zoubir" uniqKey="Mammeri Z" first="Zoubir" last="Mammeri">Zoubir Mammeri</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:4FEFA4398ADCF06E68AD24AA7828D510CC192756</idno><date when="1995" year="1995">1995</date><idno type="doi">10.1016/0263-2241(94)00039-A</idno><idno type="url">https://api.istex.fr/ark:/67375/6H6-GW5L5BTZ-2/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001269</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001269</idno><idno type="wicri:Area/Istex/Curation">001252</idno><idno type="wicri:Area/Istex/Checkpoint">002A72</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002A72</idno><idno type="wicri:doubleKey">0263-2241:1995:Cardeira C:a:schedulability:analysis</idno><idno type="wicri:Area/Main/Merge">00CF14</idno><idno type="wicri:Area/Main/Curation">00C657</idno><idno type="wicri:Area/Main/Exploration">00C657</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">A schedulability analysis of tasks and network traffic in distributed real-time systems</title><author><name sortKey="Cardeira, Carlos" sort="Cardeira, Carlos" uniqKey="Cardeira C" first="Carlos" last="Cardeira">Carlos Cardeira</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>CRAN (CNRS URA 821), Ensem, 2 Avenue de la For̂et de Haye, F-54516 Vandœuvre-les-Nancy Cedex</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></author><author><name sortKey="Mammeri, Zoubir" sort="Mammeri, Zoubir" uniqKey="Mammeri Z" first="Zoubir" last="Mammeri">Zoubir Mammeri</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>2CRIN (CNRS URA 262), Ensem, 2 Avenue de la Forêt de Haye, F-54516 Vandœuvre-les-Nancy Cedex</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></author></analytic><monogr></monogr><series><title level="j">Measurement</title><title level="j" type="abbrev">MEASUR</title><idno type="ISSN">0263-2241</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1995">1995</date><biblScope unit="volume">15</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="71">71</biblScope><biblScope unit="page" to="83">83</biblScope></imprint><idno type="ISSN">0263-2241</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0263-2241</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term><term>Algorithm execution time</term><term>Allocation constraints</term><term>Application timing constraints</term><term>Arbitrator</term><term>Arbitrator station</term><term>Arbitrator turnaround time</term><term>Cardeira</term><term>Central controller</term><term>Centralized systems</term><term>Certain cost</term><term>Classical devices</term><term>Communication load</term><term>Communication systems</term><term>Comput</term><term>Computation time</term><term>Computer science</term><term>Configuration tool</term><term>Constraint</term><term>Different networks</term><term>Digital information</term><term>Elementary network</term><term>Execution time</term><term>Fault tolerance</term><term>Fieldbus</term><term>Fieldbus traffic</term><term>Flow control</term><term>Global scheduling</term><term>Global scheduling algorithms</term><term>Global task scheduling</term><term>Hard systems</term><term>Hardware costs</term><term>Ieee</term><term>Ieee trans</term><term>Incremental tasks</term><term>Inevitable noise</term><term>International standards organization</term><term>Internetworking devices</term><term>Large number</term><term>Main idea</term><term>Mammeri</term><term>Message scheduling</term><term>Message transmission</term><term>Monoprocessor</term><term>Monoprocessor task scheduling</term><term>Multiprocessor</term><term>Multiprocessor scheduling</term><term>Multiprocessor task scheduling</term><term>Network traffic</term><term>Neural networks</term><term>Node</term><term>Optimization criteria</term><term>Optimization criterion</term><term>Other words</term><term>Overall goal</term><term>Physical layer specifications</term><term>Physical medium</term><term>Physical process</term><term>Physical support</term><term>Precedence constraints</term><term>Preemption</term><term>Preemptive</term><term>Preemptive algorithms</term><term>Processing capabilities</term><term>Processor</term><term>Protocol</term><term>Real time systems</term><term>Resource constraints</term><term>Same time</term><term>Sampling table</term><term>Schedulability analysis</term><term>Schedule length</term><term>Schedule tasks</term><term>Scheduling</term><term>Scheduling algorithm</term><term>Scheduling algorithms</term><term>Scheduling point</term><term>Scheduling tasks</term><term>Scheduling viewpoint</term><term>Session layer</term><term>Single processor</term><term>Software</term><term>Software engineering</term><term>Standard fieldbus</term><term>Task execution</term><term>Task execution time</term><term>Task migration</term><term>Task scheduling</term><term>Task scheduling algorithms</term><term>Temporal aspects</term><term>Temporal validity</term><term>Time window</term><term>Timing constraints</term><term>Traffic scheduling</term><term>Trans</term><term>Transmission time</term><term>Transmission times</term><term>Transport layer</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In real-time systems the deadlines of each task must be met. A pre-run-time schedulability analysis becomes necessary to prove that the existing software and target hardware will meet the real-time application constraints. In a real-time distributed system, the messages transmitted through the network are also time constrained. However, some new problems arise when one applies existing task scheduling algorithms to schedule the network traffic. The main goal of this paper is to define the boundaries between these two domains of scheduling. After an introduction to fieldbuses and real-time systems, we present an equivalence between tasks and messages as well as between processors and networks, which are much different in practice but have strong similarities from the scheduling point of view. Finally, we analyse the new constraints introduced by the presence of smart transducers/transmitters in fieldbus applications and we define the scheduling algorithms adapted for this type of applications.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Vandœuvre-lès-Nancy</li></settlement></list><tree><country name="France"><region name="Grand Est"><name sortKey="Cardeira, Carlos" sort="Cardeira, Carlos" uniqKey="Cardeira C" first="Carlos" last="Cardeira">Carlos Cardeira</name></region><name sortKey="Mammeri, Zoubir" sort="Mammeri, Zoubir" uniqKey="Mammeri Z" first="Zoubir" last="Mammeri">Zoubir Mammeri</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C657 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C657 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:4FEFA4398ADCF06E68AD24AA7828D510CC192756
|texte= A schedulability analysis of tasks and network traffic in distributed real-time systems
}}
| This area was generated with Dilib version V0.6.33. |  |