Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks
Identifieur interne : 001938 ( Crin/Curation ); précédent : 001937; suivant : 001939Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks
Auteurs : C. Cardeira ; Z. MammeriSource :
English descriptors
- KwdEn :
Abstract
Artificial Neural Networks have already proved their usefulness in approximate solving, combinatorial optimization problems, and they have the advantage of reaching extremely rapid solution rates. This paper presents an ANN based approach to solve real-time tasks scheduling, and it shows that by a careful choice of an ANN topology, one can solve real-time tasks scheduling problems taking into account timing constraints (such as deadlines, earliest times, periods, maximum execution times), preemption and non-preemption of tasks in mono or multiprocessor architectures. ANN-based scheduling algorithms are not time-consuming so they can be used on-line in real-time systems contrary to most approximate techniques for problem solving.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001938
Links to Exploration step
CRIN:cardeira95cLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="213">Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:cardeira95c</idno>
<date when="1995" year="1995">1995</date>
<idno type="wicri:Area/Crin/Corpus">001938</idno>
<idno type="wicri:Area/Crin/Curation">001938</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001938</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks</title>
<author><name sortKey="Cardeira, C" sort="Cardeira, C" uniqKey="Cardeira C" first="C." last="Cardeira">C. Cardeira</name>
</author>
<author><name sortKey="Mammeri, Z" sort="Mammeri, Z" uniqKey="Mammeri Z" first="Z." last="Mammeri">Z. Mammeri</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>constraint satisfaction</term>
<term>multiprocessor</term>
<term>neural network</term>
<term>real-time scheduling algorithm</term>
<term>task</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="2595">Artificial Neural Networks have already proved their usefulness in approximate solving, combinatorial optimization problems, and they have the advantage of reaching extremely rapid solution rates. This paper presents an ANN based approach to solve real-time tasks scheduling, and it shows that by a careful choice of an ANN topology, one can solve real-time tasks scheduling problems taking into account timing constraints (such as deadlines, earliest times, periods, maximum execution times), preemption and non-preemption of tasks in mono or multiprocessor architectures. ANN-based scheduling algorithms are not time-consuming so they can be used on-line in real-time systems contrary to most approximate techniques for problem solving.</div>
</front>
</TEI>
<BibTex type="inproceedings"><ref>cardeira95c</ref>
<crinnumber>95-R-192</crinnumber>
<category>3</category>
<equipe>INFORMATIQUE INDUSTRIELLE</equipe>
<author><e>Cardeira, C.</e>
<e>Mammeri, Z.</e>
</author>
<title>Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks</title>
<booktitle>{Proceedings 13th IFAC Workshop on Distributed Computer Control Systems, Toulouse}</booktitle>
<year>1995</year>
<editor>A.-E.-K. Sahraoui and J.-A. de la Puente</editor>
<pages>67-72</pages>
<month>sep</month>
<keywords><e>real-time scheduling algorithm</e>
<e>neural network</e>
<e>task</e>
<e>constraint satisfaction</e>
<e>multiprocessor</e>
</keywords>
<abstract>Artificial Neural Networks have already proved their usefulness in approximate solving, combinatorial optimization problems, and they have the advantage of reaching extremely rapid solution rates. This paper presents an ANN based approach to solve real-time tasks scheduling, and it shows that by a careful choice of an ANN topology, one can solve real-time tasks scheduling problems taking into account timing constraints (such as deadlines, earliest times, periods, maximum execution times), preemption and non-preemption of tasks in mono or multiprocessor architectures. ANN-based scheduling algorithms are not time-consuming so they can be used on-line in real-time systems contrary to most approximate techniques for problem solving.</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 001938 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 001938 | 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:cardeira95c |texte= Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks }}
This area was generated with Dilib version V0.6.33. |