Skip to Main content Skip to Navigation
Conference papers

(m, k)–firm constraints and DBP scheduling: impact of the initial k-sequence and exact schedulability test

Abstract : In this paper we study the scheduling of (m, k)–firm synchronous periodic task systems using the Distance Based Priority (DBP) scheduler. We first show three phenomena: (i) choosing, for each task, the initial k-sequence 1k is not optimal, (ii) we can even start the scheduling from a (fictive) error state (in regard to the initial k-sequence) and (iii) the period of feasible DBP-schedules is not necessarily the task hyper-period. We then show that any feasible DBPschedule is periodic and we upper-bound the length of that period. Lastly, based on our periodicity result we provide an exact schedulability test.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00336461
Contributor : Anne Jaigu <>
Submitted on : Tuesday, November 4, 2008 - 10:53:22 AM
Last modification on : Thursday, June 4, 2020 - 10:34:02 AM
Long-term archiving on: : Monday, June 7, 2010 - 10:42:29 PM

File

goossens.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00336461, version 1

Collections

Citation

Joël Goossens. (m, k)–firm constraints and DBP scheduling: impact of the initial k-sequence and exact schedulability test. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Isabelle Puaut, Oct 2008, Rennes, France. ⟨inria-00336461⟩

Share

Metrics

Record views

85

Files downloads

227