New On-Line Scheduling Policies for Improving Real-Time Behavior
Identifieur interne : 004180 ( Crin/Corpus ); précédent : 004179; suivant : 004181New On-Line Scheduling Policies for Improving Real-Time Behavior
Auteurs : Mathieu Grenier ; Nicolas NavetSource :
English descriptors
- KwdEn :
Abstract
In real-time systems, schedulability is mandatory but other application-dependent performance criteria are most generally of interest. We first define the properties that a .good. real-time scheduling algorithm must possess. Then, we exhibit a class of easily-implementable policies that should be well suited to various applicative contexts because, in our experiments, these policies provide good trade-off between feasibility and the satisfaction of the application-dependent criteria. We propose a schedulability analysis generic for all policies within this class and evaluate other criteria by simulation. The study is illustrated in the framework of computer-controlled systems that are known to be sensitive to various delays induced by resource sharing.
Links to Exploration step
CRIN:grenier05aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="370">New On-Line Scheduling Policies for Improving Real-Time Behavior</title></titleStmt><publicationStmt><idno type="RBID">CRIN:grenier05a</idno><date when="2005" year="2005">2005</date><idno type="wicri:Area/Crin/Corpus">004180</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">New On-Line Scheduling Policies for Improving Real-Time Behavior</title><author><name sortKey="Grenier, Mathieu" sort="Grenier, Mathieu" uniqKey="Grenier M" first="Mathieu" last="Grenier">Mathieu Grenier</name></author><author><name sortKey="Navet, Nicolas" sort="Navet, Nicolas" uniqKey="Navet N" first="Nicolas" last="Navet">Nicolas Navet</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>improve</term><term>on-line policies</term><term>real-time</term><term>scheduling</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1504">In real-time systems, schedulability is mandatory but other application-dependent performance criteria are most generally of interest. We first define the properties that a .good. real-time scheduling algorithm must possess. Then, we exhibit a class of easily-implementable policies that should be well suited to various applicative contexts because, in our experiments, these policies provide good trade-off between feasibility and the satisfaction of the application-dependent criteria. We propose a schedulability analysis generic for all policies within this class and evaluate other criteria by simulation. The study is illustrated in the framework of computer-controlled systems that are known to be sensitive to various delays induced by resource sharing.</div></front></TEI><BibTex type="inproceedings"><ref>grenier05a</ref><crinnumber>A05-R-168</crinnumber><category>3</category><equipe>TRIO</equipe><author><e>Grenier, Mathieu</e><e>Navet, Nicolas</e></author><title>New On-Line Scheduling Policies for Improving Real-Time Behavior</title><booktitle>{10th IEEE International Conference on Emerging Technologies and Factory Automation - ETFA 2005, Catania, Italy}</booktitle><year>2005</year><volume>2</volume><pages>315--322</pages><month>Sep</month><publisher>IEEE</publisher><keywords><e>real-time</e><e>scheduling</e><e>on-line policies</e><e>improve</e></keywords><abstract>In real-time systems, schedulability is mandatory but other application-dependent performance criteria are most generally of interest. We first define the properties that a .good. real-time scheduling algorithm must possess. Then, we exhibit a class of easily-implementable policies that should be well suited to various applicative contexts because, in our experiments, these policies provide good trade-off between feasibility and the satisfaction of the application-dependent criteria. We propose a schedulability analysis generic for all policies within this class and evaluate other criteria by simulation. The study is illustrated in the framework of computer-controlled systems that are known to be sensitive to various delays induced by resource sharing.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004180 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 004180 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Corpus
|type= RBID
|clé= CRIN:grenier05a
|texte= New On-Line Scheduling Policies for Improving Real-Time Behavior
}}
| This area was generated with Dilib version V0.6.33. |  |