Schedulability analysis for system under (m,k)-firm constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Schedulability analysis for system under (m,k)-firm constraints

Jian Li
  • Function : Author
  • PersonId : 831029
Ye-Qiong Song


(m,k)-firm model has recently drawn many attentions for providing a flexible real-time system with graceful degradation of the QoS. DBP algorithm is an attractive one as it dynamically assigns 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 used for bandwidth dimensioning of the communication system of the distributed control system showing its practical usefulness.
No file

Dates and versions

inria-00099992 , version 1 (26-09-2006)


  • HAL Id : inria-00099992 , version 1


Jian Li, Ye-Qiong Song, Françoise Simonot-Lion. Schedulability analysis for system under (m,k)-firm constraints. 5th IEEE International Workshop on Factory Communication System - WFCS'2004, 2004, Vienne, Autriche. ⟨inria-00099992⟩
41 View
0 Download


Gmail Facebook Twitter LinkedIn More