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.

Providing real-time applications with graceful degradation of QoS and fault tolerance according to (m,k)-firm model

Identifieur interne : 005F46 ( Main/Merge ); précédent : 005F45; suivant : 005F47

Providing real-time applications with graceful degradation of QoS and fault tolerance according to (m,k)-firm model

Auteurs : Jian Li ; Yeqiong Song ; Françoise Simonot-Lion

Source :

RBID : CRIN:li05a

Abstract

(m,k)-firm model has recently drawn a lot of attention. It provides a flexible real-time system with graceful degradation of the QoS, thus achieving the fault tolerance in case of system overload. In this paper we first give a review of the existing work on the use of the (m,k)-firm model for handling the QoS and fault tolerance management. Then we focus on DBP algorithm as it presents the interesting feature of dynamically assigning the priorities according to the system's current state (QoS-aware scheduling). However, DBP cannot readily be used for systems requiring deterministic (m,k)-firm guarantee since the schedulability analysis was not done in the original proposition. In this paper a sufficient schedulability condition is given to deterministically guarantee a set of periodic or sporadic activities (jobs) sharing a common non-preemptive server. This condition is applied to two case studies showing its practical usefulness for both bandwidth dimensioning of the communication system providing graceful degradation of QoS and the task scheduling in an in-vehicle embedded system allowing fault tolerance.

Links toward previous steps (curation, corpus...)


Links to Exploration step

CRIN:li05a

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" wicri:score="590">Providing real-time applications with graceful degradation of QoS and fault tolerance according to (m,k)-firm model</title>
</titleStmt>
<publicationStmt>
<idno type="RBID">CRIN:li05a</idno>
<date when="2005" year="2005">2005</date>
<idno type="wicri:Area/Crin/Corpus">004416</idno>
<idno type="wicri:Area/Crin/Curation">004416</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">004416</idno>
<idno type="wicri:Area/Crin/Checkpoint">000171</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000171</idno>
<idno type="wicri:Area/Main/Merge">005F46</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Providing real-time applications with graceful degradation of QoS and fault tolerance according to (m,k)-firm model</title>
<author>
<name sortKey="Li, Jian" sort="Li, Jian" uniqKey="Li J" first="Jian" last="Li">Jian Li</name>
</author>
<author>
<name sortKey="Song, Yeqiong" sort="Song, Yeqiong" uniqKey="Song Y" first="Yeqiong" last="Song">Yeqiong Song</name>
</author>
<author>
<name sortKey="Simonot Lion, Francoise" sort="Simonot Lion, Francoise" uniqKey="Simonot Lion F" first="Françoise" last="Simonot-Lion">Françoise Simonot-Lion</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass></textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en" wicri:score="4100">(m,k)-firm model has recently drawn a lot of attention. It provides a flexible real-time system with graceful degradation of the QoS, thus achieving the fault tolerance in case of system overload. In this paper we first give a review of the existing work on the use of the (m,k)-firm model for handling the QoS and fault tolerance management. Then we focus on DBP algorithm as it presents the interesting feature of dynamically assigning the priorities according to the system's current state (QoS-aware scheduling). However, DBP cannot readily be used for systems requiring deterministic (m,k)-firm guarantee since the schedulability analysis was not done in the original proposition. In this paper a sufficient schedulability condition is given to deterministically guarantee a set of periodic or sporadic activities (jobs) sharing a common non-preemptive server. This condition is applied to two case studies showing its practical usefulness for both bandwidth dimensioning of the communication system providing graceful degradation of QoS and the task scheduling in an in-vehicle embedded system allowing fault tolerance.</div>
</front>
</TEI>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005F46 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 005F46 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Merge
   |type=    RBID
   |clé=     CRIN:li05a
   |texte=   Providing real-time applications with graceful degradation of QoS and fault tolerance according to (m,k)-firm model
}}

Wicri

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