Relaxed (m,k)-firm Constraint to Improve Real-time Streams Admission Rate under Non Pre-emptive Fixed Priority Scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

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

Jian Li
  • Fonction : Auteur
  • PersonId : 831029
Ye-Qiong Song

Résumé

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.
Fichier principal
Vignette du fichier
ETFA_camera_ready.pdf (226.92 Ko) Télécharger le fichier

Dates et versions

inria-00108422 , version 1 (20-10-2006)

Identifiants

  • HAL Id : inria-00108422 , version 1

Citer

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. ⟨inria-00108422⟩
86 Consultations
177 Téléchargements

Partager

Gmail Facebook X LinkedIn More