InforLorV4, PascalFrancis, Corpus, bibRecord, 000465

Optimisation de performance pour des systèmes temps réel stricts à priorité fixe

Identifieur interne : 000465 ( PascalFrancis/Corpus ); précédent : 000464; suivant : 000466

Optimisation de performance pour des systèmes temps réel stricts à priorité fixe

Auteurs : Joël Goossens ; Pascal Richard

Source :

TSI. Technique et science informatiques [ 0752-4072 ] ; 2005.

RBID : Pascal:06-0149162

Descripteurs français

Pascal (Inist)
- Ordonnancement processeur, Système temps réel, Priorité, Temps réel, Qualité service, Temps réponse, Date limite, Moyenne temporelle, Réponse temporelle, Optimisation, Méthode séparation et évaluation, Moyenne pondérée.

English descriptors

KwdEn :
- Branch and bound method, Deadline, Optimization, Priority, Processor scheduling, Real time, Real time system, Response time, Service quality, Time average, Time response, Weighted average.

Abstract

Many real-time systems must simultaneously handle hard real-time constraints and Quality of Service constraints. Thus, a performance criterion must be optimized for some tasks while meeting all deadlines for hard real-time tasks. For that purpose, we present a generic Branch & Bound method dedicated to hard real-time fixed-priority schedulers. Our approach is based on a generic algorithm that defines common functions to any performance criteria. Only few functions need to be specialized to deal with a specific criterion. We then present such a specialization for minimizing the weighted average response time of tasks.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0752-4072`
A02	`01`			`@0 TTSIDJ`
A03		`1`		`@0 TSI, Tech. sci. inform.`
A05				`@2 24`
A06				`@2 8`
A08	`01`	`1`	`FRE`	`@1 Optimisation de performance pour des systèmes temps réel stricts à priorité fixe`
A09	`01`	`1`	`FRE`	`@1 Ordonnancement pour les systèmes temps réel`
A11	`01`	`1`		`@1 GOOSSENS (Joël)`
A11	`02`	`1`		`@1 RICHARD (Pascal)`
A12	`01`	`1`		`@1 GOOSSENS (Joël) @9 ed.`
A12	`02`	`1`		`@1 NAVET (Nicolas) @9 ed.`
A14	`01`			`@1 Université Libre de Bruxelles CP 212 50, avenue Franklin D. Roosevelt @2 1050 Bruxelles @3 BEL @Z 1 aut.`
A14	`02`			`@1 LISI/ENSMA Téléport 2 - 1, avenue Clément Ader BP 40109 @2 86961 Futuroscope Chasseneuil @3 FRA @Z 2 aut.`
A15	`01`			`@1 Université Libre de Bruxelles @3 BEL @Z 1 aut.`
A15	`02`			`@1 INRIA, laboratoire LORIA @2 Nancy @3 FRA @Z 2 aut.`
A20				`@1 991-1011`
A21				`@1 2005`
A23	`01`			`@0 FRE`
A24	`01`			`@0 eng`
A43	`01`			`@1 INIST @2 19593 @5 354000115113350040`
A44				`@0 0000 @1 © 2006 INIST-CNRS. All rights reserved.`
A45				`@0 13 ref.`
A47	`01`	`1`		`@0 06-0149162`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 TSI. Technique et science informatiques`
A66	`01`			`@0 FRA`
A68	`01`	`1`	`ENG`	`@1 Performance optimization for real time fixed priority systems`
C01	`01`		`ENG`	@0 Many real-time systems must simultaneously handle hard real-time constraints and Quality of Service constraints. Thus, a performance criterion must be optimized for some tasks while meeting all deadlines for hard real-time tasks. For that purpose, we present a generic Branch & Bound method dedicated to hard real-time fixed-priority schedulers. Our approach is based on a generic algorithm that defines common functions to any performance criteria. Only few functions need to be specialized to deal with a specific criterion. We then present such a specialization for minimizing the weighted average response time of tasks.
C02	`01`	`X`		`@0 001D02B09`
C02	`02`	`X`		`@0 001D02A05`
C03	`01`	`3`	`FRE`	`@0 Ordonnancement processeur @5 01`
C03	`01`	`3`	`ENG`	`@0 Processor scheduling @5 01`
C03	`02`	`X`	`FRE`	`@0 Système temps réel @5 06`
C03	`02`	`X`	`ENG`	`@0 Real time system @5 06`
C03	`02`	`X`	`SPA`	`@0 Sistema tiempo real @5 06`
C03	`03`	`X`	`FRE`	`@0 Priorité @5 07`
C03	`03`	`X`	`ENG`	`@0 Priority @5 07`
C03	`03`	`X`	`SPA`	`@0 Prioridad @5 07`
C03	`04`	`X`	`FRE`	`@0 Temps réel @5 08`
C03	`04`	`X`	`ENG`	`@0 Real time @5 08`
C03	`04`	`X`	`SPA`	`@0 Tiempo real @5 08`
C03	`05`	`X`	`FRE`	`@0 Qualité service @5 09`
C03	`05`	`X`	`ENG`	`@0 Service quality @5 09`
C03	`05`	`X`	`SPA`	`@0 Calidad servicio @5 09`
C03	`06`	`X`	`FRE`	`@0 Temps réponse @5 10`
C03	`06`	`X`	`ENG`	`@0 Response time @5 10`
C03	`06`	`X`	`SPA`	`@0 Tiempo respuesta @5 10`
C03	`07`	`X`	`FRE`	`@0 Date limite @5 18`
C03	`07`	`X`	`ENG`	`@0 Deadline @5 18`
C03	`07`	`X`	`SPA`	`@0 Fechas últimas @5 18`
C03	`08`	`X`	`FRE`	`@0 Moyenne temporelle @5 19`
C03	`08`	`X`	`ENG`	`@0 Time average @5 19`
C03	`08`	`X`	`SPA`	`@0 Promedio temporal @5 19`
C03	`09`	`X`	`FRE`	`@0 Réponse temporelle @5 20`
C03	`09`	`X`	`ENG`	`@0 Time response @5 20`
C03	`09`	`X`	`SPA`	`@0 Respuesta temporal @5 20`
C03	`10`	`X`	`FRE`	`@0 Optimisation @5 23`
C03	`10`	`X`	`ENG`	`@0 Optimization @5 23`
C03	`10`	`X`	`SPA`	`@0 Optimización @5 23`
C03	`11`	`X`	`FRE`	`@0 Méthode séparation et évaluation @5 24`
C03	`11`	`X`	`ENG`	`@0 Branch and bound method @5 24`
C03	`11`	`X`	`SPA`	`@0 Método branch and bound @5 24`
C03	`12`	`X`	`FRE`	`@0 Moyenne pondérée @4 CD @5 96`
C03	`12`	`X`	`ENG`	`@0 Weighted average @4 CD @5 96`
N21				`@1 093`

Format Inist (serveur)

NO :	PASCAL 06-0149162 INIST
FT :	Optimisation de performance pour des systèmes temps réel stricts à priorité fixe
ET :	(Performance optimization for real time fixed priority systems)
AU :	GOOSSENS (Joël); RICHARD (Pascal); GOOSSENS (Joël); NAVET (Nicolas)
AF :	Université Libre de Bruxelles CP 212 50, avenue Franklin D. Roosevelt/1050 Bruxelles/Belgique (1 aut.); LISI/ENSMA Téléport 2 - 1, avenue Clément Ader BP 40109/86961 Futuroscope Chasseneuil/France (2 aut.); Université Libre de Bruxelles/Belgique (1 aut.); INRIA, laboratoire LORIA/Nancy/France (2 aut.)
DT :	Publication en série; Niveau analytique
SO :	TSI. Technique et science informatiques; ISSN 0752-4072; Coden TTSIDJ; France; Da. 2005; Vol. 24; No. 8; Pp. 991-1011; Abs. anglais; Bibl. 13 ref.
LA :	Français
EA :	Many real-time systems must simultaneously handle hard real-time constraints and Quality of Service constraints. Thus, a performance criterion must be optimized for some tasks while meeting all deadlines for hard real-time tasks. For that purpose, we present a generic Branch & Bound method dedicated to hard real-time fixed-priority schedulers. Our approach is based on a generic algorithm that defines common functions to any performance criteria. Only few functions need to be specialized to deal with a specific criterion. We then present such a specialization for minimizing the weighted average response time of tasks.
CC :	001D02B09; 001D02A05
FD :	Ordonnancement processeur; Système temps réel; Priorité; Temps réel; Qualité service; Temps réponse; Date limite; Moyenne temporelle; Réponse temporelle; Optimisation; Méthode séparation et évaluation; Moyenne pondérée
ED :	Processor scheduling; Real time system; Priority; Real time; Service quality; Response time; Deadline; Time average; Time response; Optimization; Branch and bound method; Weighted average
SD :	Sistema tiempo real; Prioridad; Tiempo real; Calidad servicio; Tiempo respuesta; Fechas últimas; Promedio temporal; Respuesta temporal; Optimización; Método branch and bound
LO :	INIST-19593.354000115113350040
ID :	06-0149162

Links to Exploration step

Pascal:06-0149162

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="fr" level="a">Optimisation de performance pour des systèmes temps réel stricts à priorité fixe</title>
<author><name sortKey="Goossens, Joel" sort="Goossens, Joel" uniqKey="Goossens J" first="Joël" last="Goossens">Joël Goossens</name>
<affiliation><inist:fA14 i1="01"><s1>Université Libre de Bruxelles CP 212 50, avenue Franklin D. Roosevelt</s1>
<s2>1050 Bruxelles</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Richard, Pascal" sort="Richard, Pascal" uniqKey="Richard P" first="Pascal" last="Richard">Pascal Richard</name>
<affiliation><inist:fA14 i1="02"><s1>LISI/ENSMA Téléport 2 - 1, avenue Clément Ader BP 40109</s1>
<s2>86961 Futuroscope Chasseneuil</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">06-0149162</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 06-0149162 INIST</idno>
<idno type="RBID">Pascal:06-0149162</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000465</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="fr" level="a">Optimisation de performance pour des systèmes temps réel stricts à priorité fixe</title>
<author><name sortKey="Goossens, Joel" sort="Goossens, Joel" uniqKey="Goossens J" first="Joël" last="Goossens">Joël Goossens</name>
<affiliation><inist:fA14 i1="01"><s1>Université Libre de Bruxelles CP 212 50, avenue Franklin D. Roosevelt</s1>
<s2>1050 Bruxelles</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Richard, Pascal" sort="Richard, Pascal" uniqKey="Richard P" first="Pascal" last="Richard">Pascal Richard</name>
<affiliation><inist:fA14 i1="02"><s1>LISI/ENSMA Téléport 2 - 1, avenue Clément Ader BP 40109</s1>
<s2>86961 Futuroscope Chasseneuil</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">TSI. Technique et science informatiques</title>
<title level="j" type="abbreviated">TSI, Tech. sci. inform.</title>
<idno type="ISSN">0752-4072</idno>
<imprint><date when="2005">2005</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">TSI. Technique et science informatiques</title>
<title level="j" type="abbreviated">TSI, Tech. sci. inform.</title>
<idno type="ISSN">0752-4072</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Branch and bound method</term>
<term>Deadline</term>
<term>Optimization</term>
<term>Priority</term>
<term>Processor scheduling</term>
<term>Real time</term>
<term>Real time system</term>
<term>Response time</term>
<term>Service quality</term>
<term>Time average</term>
<term>Time response</term>
<term>Weighted average</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Ordonnancement processeur</term>
<term>Système temps réel</term>
<term>Priorité</term>
<term>Temps réel</term>
<term>Qualité service</term>
<term>Temps réponse</term>
<term>Date limite</term>
<term>Moyenne temporelle</term>
<term>Réponse temporelle</term>
<term>Optimisation</term>
<term>Méthode séparation et évaluation</term>
<term>Moyenne pondérée</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Many real-time systems must simultaneously handle hard real-time constraints and Quality of Service constraints. Thus, a performance criterion must be optimized for some tasks while meeting all deadlines for hard real-time tasks. For that purpose, we present a generic Branch & Bound method dedicated to hard real-time fixed-priority schedulers. Our approach is based on a generic algorithm that defines common functions to any performance criteria. Only few functions need to be specialized to deal with a specific criterion. We then present such a specialization for minimizing the weighted average response time of tasks.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0752-4072</s0>
</fA01>
<fA02 i1="01"><s0>TTSIDJ</s0>
</fA02>
<fA03 i2="1"><s0>TSI, Tech. sci. inform.</s0>
</fA03>
<fA05><s2>24</s2>
</fA05>
<fA06><s2>8</s2>
</fA06>
<fA08 i1="01" i2="1" l="FRE"><s1>Optimisation de performance pour des systèmes temps réel stricts à priorité fixe</s1>
</fA08>
<fA09 i1="01" i2="1" l="FRE"><s1>Ordonnancement pour les systèmes temps réel</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>GOOSSENS (Joël)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>RICHARD (Pascal)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>GOOSSENS (Joël)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>NAVET (Nicolas)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Université Libre de Bruxelles CP 212 50, avenue Franklin D. Roosevelt</s1>
<s2>1050 Bruxelles</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LISI/ENSMA Téléport 2 - 1, avenue Clément Ader BP 40109</s1>
<s2>86961 Futuroscope Chasseneuil</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>Université Libre de Bruxelles</s1>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA15 i1="02"><s1>INRIA, laboratoire LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA15>
<fA20><s1>991-1011</s1>
</fA20>
<fA21><s1>2005</s1>
</fA21>
<fA23 i1="01"><s0>FRE</s0>
</fA23>
<fA24 i1="01"><s0>eng</s0>
</fA24>
<fA43 i1="01"><s1>INIST</s1>
<s2>19593</s2>
<s5>354000115113350040</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2006 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>13 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>06-0149162</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>TSI. Technique et science informatiques</s0>
</fA64>
<fA66 i1="01"><s0>FRA</s0>
</fA66>
<fA68 i1="01" i2="1" l="ENG"><s1>Performance optimization for real time fixed priority systems</s1>
</fA68>
<fC01 i1="01" l="ENG"><s0>Many real-time systems must simultaneously handle hard real-time constraints and Quality of Service constraints. Thus, a performance criterion must be optimized for some tasks while meeting all deadlines for hard real-time tasks. For that purpose, we present a generic Branch & Bound method dedicated to hard real-time fixed-priority schedulers. Our approach is based on a generic algorithm that defines common functions to any performance criteria. Only few functions need to be specialized to deal with a specific criterion. We then present such a specialization for minimizing the weighted average response time of tasks.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B09</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="3" l="FRE"><s0>Ordonnancement processeur</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="3" l="ENG"><s0>Processor scheduling</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Système temps réel</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Real time system</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Sistema tiempo real</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Priorité</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Priority</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Prioridad</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Temps réel</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Real time</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Tiempo real</s0>
<s5>08</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Qualité service</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Service quality</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Calidad servicio</s0>
<s5>09</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Temps réponse</s0>
<s5>10</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Response time</s0>
<s5>10</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Tiempo respuesta</s0>
<s5>10</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Date limite</s0>
<s5>18</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Deadline</s0>
<s5>18</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Fechas últimas</s0>
<s5>18</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Moyenne temporelle</s0>
<s5>19</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Time average</s0>
<s5>19</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Promedio temporal</s0>
<s5>19</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Réponse temporelle</s0>
<s5>20</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Time response</s0>
<s5>20</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Respuesta temporal</s0>
<s5>20</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Optimisation</s0>
<s5>23</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Optimization</s0>
<s5>23</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Optimización</s0>
<s5>23</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Méthode séparation et évaluation</s0>
<s5>24</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Branch and bound method</s0>
<s5>24</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Método branch and bound</s0>
<s5>24</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Moyenne pondérée</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Weighted average</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>093</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 06-0149162 INIST</NO>
<FT>Optimisation de performance pour des systèmes temps réel stricts à priorité fixe</FT>
<ET>(Performance optimization for real time fixed priority systems)</ET>
<AU>GOOSSENS (Joël); RICHARD (Pascal); GOOSSENS (Joël); NAVET (Nicolas)</AU>
<AF>Université Libre de Bruxelles CP 212 50, avenue Franklin D. Roosevelt/1050 Bruxelles/Belgique (1 aut.); LISI/ENSMA Téléport 2 - 1, avenue Clément Ader BP 40109/86961 Futuroscope Chasseneuil/France (2 aut.); Université Libre de Bruxelles/Belgique (1 aut.); INRIA, laboratoire LORIA/Nancy/France (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>TSI. Technique et science informatiques; ISSN 0752-4072; Coden TTSIDJ; France; Da. 2005; Vol. 24; No. 8; Pp. 991-1011; Abs. anglais; Bibl. 13 ref.</SO>
<LA>Français</LA>
<EA>Many real-time systems must simultaneously handle hard real-time constraints and Quality of Service constraints. Thus, a performance criterion must be optimized for some tasks while meeting all deadlines for hard real-time tasks. For that purpose, we present a generic Branch & Bound method dedicated to hard real-time fixed-priority schedulers. Our approach is based on a generic algorithm that defines common functions to any performance criteria. Only few functions need to be specialized to deal with a specific criterion. We then present such a specialization for minimizing the weighted average response time of tasks.</EA>
<CC>001D02B09; 001D02A05</CC>
<FD>Ordonnancement processeur; Système temps réel; Priorité; Temps réel; Qualité service; Temps réponse; Date limite; Moyenne temporelle; Réponse temporelle; Optimisation; Méthode séparation et évaluation; Moyenne pondérée</FD>
<ED>Processor scheduling; Real time system; Priority; Real time; Service quality; Response time; Deadline; Time average; Time response; Optimization; Branch and bound method; Weighted average</ED>
<SD>Sistema tiempo real; Prioridad; Tiempo real; Calidad servicio; Tiempo respuesta; Fechas últimas; Promedio temporal; Respuesta temporal; Optimización; Método branch and bound</SD>
<LO>INIST-19593.354000115113350040</LO>
<ID>06-0149162</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000465 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000465 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:06-0149162
   |texte=   Optimisation de performance pour des systèmes temps réel stricts à priorité fixe
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Optimisation de performance pour des systèmes temps réel stricts à priorité fixe

Optimisation de performance pour des systèmes temps réel stricts à priorité fixe

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri