(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.
Type de document :
Communication dans un congrès
Giorgio Buttazzo and Pascale Minet. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Oct 2008, Rennes, France. 2008
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00336461
Contributeur : Anne Jaigu <>
Soumis le : mardi 4 novembre 2008 - 10:53:22
Dernière modification le : mardi 4 novembre 2008 - 11:24:25
Document(s) archivé(s) le : lundi 7 juin 2010 - 22:42:29

Fichier

goossens.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. Giorgio Buttazzo and Pascale Minet. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Oct 2008, Rennes, France. 2008. 〈inria-00336461〉

Partager

Métriques

Consultations de la notice

56

Téléchargements de fichiers

89