Skip to Main content Skip to Navigation
Conference papers

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

Jian Li 1 Ye-Qiong Song 1 Françoise Simonot-Lion 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : (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.
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:13:14 AM
Last modification on : Tuesday, March 16, 2021 - 5:42:05 PM


  • 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⟩



Record views