InforLorV4, Hal, Corpus, bibRecord, 003997

Optimized coordinated design of control laws and scheduling policies

Identifieur interne : 003997 ( Hal/Corpus ); précédent : 003996; suivant : 003998

Optimized coordinated design of control laws and scheduling policies

Auteurs : Ning Jia

Source :

RBID : Hal:tel-00369354

Descripteurs français

mix :
- (m, QdC, dégradation acceptable, k)-firm, optimisation, ordonnancement, temps Réel.

English descriptors

mix :
- QoC, graceful degradation, optimization, real-time, scheduling.

Abstract

In this thesis, we study a coordinated approach for the design of control laws and scheduling parameters. The first objective is to propose and evaluate a technique to control the degradation of the quality of control (QoC) by selectively rejecting task or message instances according to the (m,k)-firm model. More specifically, we have studied the impact of the (m,k)-firm packet dropout policy on the QoC of a control loop. Based on the obtained results, we have specified a co-design method for determining the parameters (gain) of the optimal control
law and the (m,k)-firm constraint specifying the selective rejet of instances. This proposal was validated by using analytical techniques, simulation and experimentation activities.
The second objective is to address the scheduling problem of a set of real-time tasks where each task implements a control law in a centralized scalable application. We proposed a scheduling mechanism which determines on line, according to the current system configuration, a (m,k)-constraint based scheduling strategy to apply to each task so that the criterion reflecting the overall performance of the application is optimal at all times.

Url:

https://tel.archives-ouvertes.fr/tel-00369354

Links to Exploration step

Hal:tel-00369354

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Optimized coordinated design of control laws and scheduling policies</title>
<title xml:lang="fr">Conception conjointe optimisée de lois de contrôle et d'ordonnancement</title>
<author><name sortKey="Jia, Ning" sort="Jia, Ning" uniqKey="Jia N" first="Ning" last="Jia">Ning Jia</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2406" status="OLD"><idno type="RNSR">200218298K</idno>
<orgName>Real time and interoperability</orgName>
<orgName type="acronym">TRIO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/trio</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:tel-00369354</idno>
<idno type="halId">tel-00369354</idno>
<idno type="halUri">https://tel.archives-ouvertes.fr/tel-00369354</idno>
<idno type="url">https://tel.archives-ouvertes.fr/tel-00369354</idno>
<date when="2009-01-15">2009-01-15</date>
<idno type="wicri:Area/Hal/Corpus">003997</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Optimized coordinated design of control laws and scheduling policies</title>
<title xml:lang="fr">Conception conjointe optimisée de lois de contrôle et d'ordonnancement</title>
<author><name sortKey="Jia, Ning" sort="Jia, Ning" uniqKey="Jia N" first="Ning" last="Jia">Ning Jia</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2406" status="OLD"><idno type="RNSR">200218298K</idno>
<orgName>Real time and interoperability</orgName>
<orgName type="acronym">TRIO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/trio</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>QoC</term>
<term>graceful degradation</term>
<term>optimization</term>
<term>real-time</term>
<term>scheduling</term>
</keywords>
<keywords scheme="mix" xml:lang="fr"><term>(m</term>
<term>QdC</term>
<term>dégradation acceptable</term>
<term>k)-firm</term>
<term>optimisation</term>
<term>ordonnancement</term>
<term>temps Réel</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In this thesis, we study a coordinated approach for the design of control laws and scheduling parameters. The first objective is to propose and evaluate a technique to control the degradation of the quality of control (QoC) by selectively rejecting task or message instances according to the (m,k)-firm model. More specifically, we have studied the impact of the (m,k)-firm packet dropout policy on the QoC of a control loop. Based on the obtained results, we have specified a co-design method for determining the parameters (gain) of the optimal control
law and the (m,k)-firm constraint specifying the selective rejet of instances. This proposal was validated by using analytical techniques, simulation and experimentation activities.
The second objective is to address the scheduling problem of a set of real-time tasks where each task implements a control law in a centralized scalable application. We proposed a scheduling mechanism which determines on line, according to the current system configuration, a (m,k)-constraint based scheduling strategy to apply to each task so that the criterion reflecting the overall performance of the application is optimal at all times.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Optimized coordinated design of control laws and scheduling policies</title>
<title xml:lang="fr">Conception conjointe optimisée de lois de contrôle et d'ordonnancement</title>
<author role="aut"><persName><forename type="first">Ning</forename>
<surname>Jia</surname>
</persName>
<email></email>
<idno type="halauthor">391903</idno>
<affiliation ref="#struct-2406"></affiliation>
</author>
<editor role="depositor"><persName><forename>Françoise</forename>
<surname>Simonot-Lion</surname>
</persName>
<email>francoise.simonot@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2009-03-19 14:33:22</date>
<date type="whenModified">2016-05-19 01:09:21</date>
<date type="whenReleased">2009-03-19 14:42:37</date>
<date type="whenProduced">2009-01-15</date>
<date type="whenEndEmbargoed">2009-03-19</date>
<ref type="file" target="https://tel.archives-ouvertes.fr/tel-00369354/document"><date notBefore="2009-03-19"></date>
</ref>
<ref type="file" n="1" target="https://tel.archives-ouvertes.fr/tel-00369354/file/These_de_Ning_Version_Finale.pdf"><date notBefore="2009-03-19"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="103631"><persName><forename>Françoise</forename>
<surname>Simonot-Lion</surname>
</persName>
<email>francoise.simonot@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">tel-00369354</idno>
<idno type="halUri">https://tel.archives-ouvertes.fr/tel-00369354</idno>
<idno type="halBibtex">jia:tel-00369354</idno>
<idno type="halRefHtml">Informatique [cs]. Institut National Polytechnique de Lorraine - INPL, 2009. Français</idno>
<idno type="halRef">Informatique [cs]. Institut National Polytechnique de Lorraine - INPL, 2009. Français</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA-NSS" p="LORIA">Réseaux, systèmes et services</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
</seriesStmt>
<notesStmt></notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Optimized coordinated design of control laws and scheduling policies</title>
<title xml:lang="fr">Conception conjointe optimisée de lois de contrôle et d'ordonnancement</title>
<author role="aut"><persName><forename type="first">Ning</forename>
<surname>Jia</surname>
</persName>
<idno type="halAuthorId">391903</idno>
<affiliation ref="#struct-2406"></affiliation>
</author>
</analytic>
<monogr><imprint><date type="dateDefended">2009-01-15</date>
</imprint>
<authority type="institution">Institut National Polytechnique de Lorraine - INPL</authority>
<authority type="supervisor">Françoise Simonot-Lion(simonot@loria.fr)</authority>
<authority type="jury">Sylviane GENTIL (rapporteur)</authority>
<authority type="jury">Daniel SIMON (rapporteur)</authority>
<authority type="jury">François CHARPILLET (examinateur)</authority>
<authority type="jury">Pascal RICHARD (président du jury)</authority>
<authority type="jury">Françoise SIMONOT-LION (co-directeur)</authority>
<authority type="jury">Ye-Qiong SONG (co-directeur)</authority>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="fr">French</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">real-time</term>
<term xml:lang="en">QoC</term>
<term xml:lang="en">graceful degradation</term>
<term xml:lang="en">scheduling</term>
<term xml:lang="en">optimization</term>
<term xml:lang="fr">temps Réel</term>
<term xml:lang="fr">(m</term>
<term xml:lang="fr">k)-firm</term>
<term xml:lang="fr">QdC</term>
<term xml:lang="fr">dégradation acceptable</term>
<term xml:lang="fr">ordonnancement</term>
<term xml:lang="fr">optimisation</term>
</keywords>
<classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
<classCode scheme="halTypology" n="THESE">Theses</classCode>
</textClass>
<abstract xml:lang="en">In this thesis, we study a coordinated approach for the design of control laws and scheduling parameters. The first objective is to propose and evaluate a technique to control the degradation of the quality of control (QoC) by selectively rejecting task or message instances according to the (m,k)-firm model. More specifically, we have studied the impact of the (m,k)-firm packet dropout policy on the QoC of a control loop. Based on the obtained results, we have specified a co-design method for determining the parameters (gain) of the optimal control
law and the (m,k)-firm constraint specifying the selective rejet of instances. This proposal was validated by using analytical techniques, simulation and experimentation activities.
The second objective is to address the scheduling problem of a set of real-time tasks where each task implements a control law in a centralized scalable application. We proposed a scheduling mechanism which determines on line, according to the current system configuration, a (m,k)-constraint based scheduling strategy to apply to each task so that the criterion reflecting the overall performance of the application is optimal at all times.</abstract>
<abstract xml:lang="fr">Le cadre de ce travail est l'étude coordonnée de lois de contrôle et d'ordonnancement. Le premier objectif est de proposer et évaluer une approche de contrôle de la dégradation de la Qualité de Contrôle (QdC) par rejet sélectif d'instances de tâches ou de messages selon le
modèle (m,k)-firm. Plus particulièrement, nous avons étudié l'impact de distribution de rejets sur la QdC d'une boucle de contrôle et, sur la base des résultats obtenus, nous avons spécifié une méthode de co-conception permettant de déterminer les paramètres (gain) optimaux de la loi de contrôle et les paramètres de la contrainte (m,k)-firm spécifiant le rejet sélectif d'instances. Cette proposition a été validée sur modèles à l'aide de techniques analytiques, par simulation ainsi que grâce à des expérimentations. Notre deuxième objectif est d'étudier le problème de l'ordonnancement d'un ensemble de tâches temps réel réalisant chacune les algorithmes de contrôle dans une application centralisée évolutive. Nous proposons un mécanisme d'ordonnancement qui ajuste en ligne les contraintes
(m,k)-firm des tâches suivant la configuration courante de l'application de manière à ce qu'un critère reflétant la performance globale de l'application soit optimal à tout instant.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

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

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

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 003997 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:tel-00369354
   |texte=   Optimized coordinated design of control laws and scheduling policies
}}

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

Optimized coordinated design of control laws and scheduling policies

Optimized coordinated design of control laws and scheduling policies

Source :

Descripteurs français

English descriptors

Abstract

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