HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00108422
Contributor : Jian Li Connect in order to contact the contributor
Submitted on : Friday, October 20, 2006 - 4:31:14 PM
Last modification on : Friday, February 4, 2022 - 3:23:32 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 8:20:03 PM

Identifiers

  • 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. ⟨inria-00108422⟩

Share

Metrics

Record views

85

Files downloads

165