Timing Analysis of Compound Scheduling Policies: Application to Posix1003.1B
Identifieur interne : 007980 ( Main/Exploration ); précédent : 007979; suivant : 007981Timing Analysis of Compound Scheduling Policies: Application to Posix1003.1B
Auteurs : Jörn Migge [France] ; Alain Jean-Marie ; Nicolas Navet [France]Source :
- Journal of Scheduling [ 1094-6136 ] ; 2003-09-01.
Descripteurs français
- mix :
Abstract
Abstract: The analysis of fixed priority preemptive scheduling has been extended in various ways to improve its usefulness for the design of real-time systems. In this paper, we define the layered preemptive priority scheduling policy which generalizes fixed preemptive priorities by combination with other policies in a layered structure. In particular, the combination with the Round Robin scheduling policy is studied. Its compliance with Posix 1003.1b requirements is shown and its timing analysis is provided. For this purpose and as a basis for the analysis of other policies, the concept of majorizing work arrival function, is introduced to synthesize essential ideas used in existing analysis of the fixed preemptive priority policy. If critical resources are protected by semaphores, the Priority Ceiling Protocol (PCP) can be used under fixed preemptive priorities to control resulting priority inversions. An extension of the PCP is proposed for Round Robin, to allow a global control of priority inversions under the layered priority policy and to prevent deadlocks. The initial timing analysis is extended to account for the effects of the protocol. The results are illustrated by a small test case.
Url:
- https://api.istex.fr/ark:/67375/VQC-XNMHRQ2Z-Q/fulltext.pdf
- http://hal-lirmm.ccsd.cnrs.fr/lirmm-00269745
- https://hal.inria.fr/inria-00099506
DOI: 10.1023/A:1024806606443
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001417
- to stream Istex, to step Curation: 001400
- to stream Istex, to step Checkpoint: 001970
- to stream Main, to step Merge: 007D59
- to stream Hal, to step Corpus: 004D48
- to stream Hal, to step Curation: 004D48
- to stream Hal, to step Checkpoint: 005338
- to stream Main, to step Merge: 008175
- to stream Hal, to step Corpus: 004D49
- to stream Hal, to step Curation: 004D49
- to stream Hal, to step Checkpoint: 005337
- to stream Main, to step Merge: 008174
- to stream Main, to step Curation: 007980
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Timing Analysis of Compound Scheduling Policies: Application to Posix1003.1B</title><author><name sortKey="Migge, Jorn" sort="Migge, Jorn" uniqKey="Migge J" first="Jörn" last="Migge">Jörn Migge</name></author><author><name sortKey="Jean Marie, Alain" sort="Jean Marie, Alain" uniqKey="Jean Marie A" first="Alain" last="Jean-Marie">Alain Jean-Marie</name></author><author><name sortKey="Navet, Nicolas" sort="Navet, Nicolas" uniqKey="Navet N" first="Nicolas" last="Navet">Nicolas Navet</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:564EDC53F95DB44551AFE88B2BF48CA6E35C04B5</idno><date when="2003" year="2003">2003</date><idno type="doi">10.1023/A:1024806606443</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-XNMHRQ2Z-Q/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001417</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001417</idno><idno type="wicri:Area/Istex/Curation">001400</idno><idno type="wicri:Area/Istex/Checkpoint">001970</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001970</idno><idno type="wicri:doubleKey">1094-6136:2003:Migge J:timing:analysis:of</idno><idno type="wicri:Area/Main/Merge">007D59</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:lirmm-00269745</idno><idno type="url">http://hal-lirmm.ccsd.cnrs.fr/lirmm-00269745</idno><idno type="wicri:Area/Hal/Corpus">004D48</idno><idno type="wicri:Area/Hal/Curation">004D48</idno><idno type="wicri:Area/Hal/Checkpoint">005338</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">005338</idno><idno type="wicri:doubleKey">1094-6136:2003:Migge J:timing:analysis:of</idno><idno type="wicri:Area/Main/Merge">008175</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00099506</idno><idno type="url">https://hal.inria.fr/inria-00099506</idno><idno type="wicri:Area/Hal/Corpus">004D49</idno><idno type="wicri:Area/Hal/Curation">004D49</idno><idno type="wicri:Area/Hal/Checkpoint">005337</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">005337</idno><idno type="wicri:doubleKey">1094-6136:2003:Migge J:timing:analysis:of</idno><idno type="wicri:Area/Main/Merge">008174</idno><idno type="wicri:Area/Main/Curation">007980</idno><idno type="wicri:Area/Main/Exploration">007980</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Timing Analysis of Compound Scheduling Policies: Application to Posix1003.1B</title><author><name sortKey="Migge, Jorn" sort="Migge, Jorn" uniqKey="Migge J" first="Jörn" last="Migge">Jörn Migge</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA–CNRS UMR 7503, TRIO Team–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></author><author><name sortKey="Jean Marie, Alain" sort="Jean Marie, Alain" uniqKey="Jean Marie A" first="Alain" last="Jean-Marie">Alain Jean-Marie</name><affiliation><wicri:noCountry code="subField">05</wicri:noCountry></affiliation></author><author><name sortKey="Navet, Nicolas" sort="Navet, Nicolas" uniqKey="Navet N" first="Nicolas" last="Navet">Nicolas Navet</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA–CNRS UMR 7503, TRIO Team–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></author></analytic><monogr></monogr><series><title level="j">Journal of Scheduling</title><title level="j" type="abbrev">Journal of Scheduling</title><idno type="ISSN">1094-6136</idno><idno type="eISSN">1099-1425</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Boston</pubPlace><date type="published" when="2003-09-01">2003-09-01</date><biblScope unit="volume">6</biblScope><biblScope unit="issue">5</biblScope><biblScope unit="page" from="457">457</biblScope><biblScope unit="page" to="482">482</biblScope></imprint><idno type="ISSN">1094-6136</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1094-6136</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="fr"><term>fixed preemptive priorities</term><term>ordonnancement temps réel</term><term>posix1003.1b</term><term>priorités fixes</term><term>real-time scheduling</term><term>round-robin</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The analysis of fixed priority preemptive scheduling has been extended in various ways to improve its usefulness for the design of real-time systems. In this paper, we define the layered preemptive priority scheduling policy which generalizes fixed preemptive priorities by combination with other policies in a layered structure. In particular, the combination with the Round Robin scheduling policy is studied. Its compliance with Posix 1003.1b requirements is shown and its timing analysis is provided. For this purpose and as a basis for the analysis of other policies, the concept of majorizing work arrival function, is introduced to synthesize essential ideas used in existing analysis of the fixed preemptive priority policy. If critical resources are protected by semaphores, the Priority Ceiling Protocol (PCP) can be used under fixed preemptive priorities to control resulting priority inversions. An extension of the PCP is proposed for Round Robin, to allow a global control of priority inversions under the layered priority policy and to prevent deadlocks. The initial timing analysis is extended to account for the effects of the protocol. The results are illustrated by a small test case.</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><noCountry><name sortKey="Jean Marie, Alain" sort="Jean Marie, Alain" uniqKey="Jean Marie A" first="Alain" last="Jean-Marie">Alain Jean-Marie</name></noCountry><country name="France"><region name="Grand Est"><name sortKey="Migge, Jorn" sort="Migge, Jorn" uniqKey="Migge J" first="Jörn" last="Migge">Jörn Migge</name></region><name sortKey="Navet, Nicolas" sort="Navet, Nicolas" uniqKey="Navet N" first="Nicolas" last="Navet">Nicolas Navet</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 007980 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 007980 | 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:564EDC53F95DB44551AFE88B2BF48CA6E35C04B5
|texte= Timing Analysis of Compound Scheduling Policies: Application to Posix1003.1B
}}
| This area was generated with Dilib version V0.6.33. |  |