Relaxed (m,k)-firm Constraint to Improve Real-time Streams Admission Rate under Non Pre-emptive Fixed Priority Scheduling

Jian Li 1 Ye-Qiong Song 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Comparing with hard real-time approach, (m,k)-firm constraint and its related scheduling policies are considered as an efficient way to increase the admission rate of real-time streams to a network thanks to the possibility to drop until k-m out of any k consecutive processing requirements, reducing thus the workload. Although it is interesting for probabilistic (m,k)-firm guarantee, we show however in this paper that for deterministic (m,k)-firm guarantee, reducing the workload by a factor of m/k does not contribute to reducing the resource requirement in general. So the relaxed (m,k)-firm constraint is proposed. The sufficient schedulability condition under non pre-emptive fixed priority scheduling is derived and its practical interest in terms of the resource requirement reduction is demonstrated.
Type de document :
Communication dans un congrès
11th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA'06,, Sep 2006, Prague, Czech Public, 2006
Liste complète des métadonnées

https://hal.inria.fr/inria-00108422
Contributeur : Jian Li <>
Soumis le : vendredi 20 octobre 2006 - 16:31:14
Dernière modification le : jeudi 11 janvier 2018 - 06:20:05
Document(s) archivé(s) le : mardi 6 avril 2010 - 20:20:03

Identifiants

  • HAL Id : inria-00108422, version 1

Collections

Citation

Jian Li, Ye-Qiong Song. Relaxed (m,k)-firm Constraint to Improve Real-time Streams Admission Rate under Non Pre-emptive Fixed Priority Scheduling. 11th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA'06,, Sep 2006, Prague, Czech Public, 2006. 〈inria-00108422〉

Partager

Métriques

Consultations de la notice

208

Téléchargements de fichiers

104