Dynamic Priority Scheduling of Periodic Tasks with Extended Precedences

Abstract : The software architecture of a critical embedded control system generally consists of a set of multi-periodic communicating tasks. In order to be able to describe such a system, we define the notion of \emph{semaphore precedence constraint}, which supports multi-rate communications that follow regular repetitive patterns. We propose a feasibility test for EDF and we study three implementations, for periodic task sets related by such extended precedences on monoprocessor architectures.
Type de document :
Communication dans un congrès
IEEE 16th Conference on Emerging Technologies Factory Automation (ETFA), Sep 2011, Toulouse, France. 2011, 〈10.1109/ETFA.2011.6059015〉
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00638941
Contributeur : Mister Dart <>
Soumis le : lundi 7 novembre 2011 - 16:27:54
Dernière modification le : mercredi 28 mars 2018 - 14:16:10
Document(s) archivé(s) le : jeudi 15 novembre 2012 - 11:25:46

Fichier

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

Identifiants

Citation

Julien Forget, Emmanuel Grolleau, Claire Pagetti, Pascal Richard. Dynamic Priority Scheduling of Periodic Tasks with Extended Precedences. IEEE 16th Conference on Emerging Technologies Factory Automation (ETFA), Sep 2011, Toulouse, France. 2011, 〈10.1109/ETFA.2011.6059015〉. 〈inria-00638941〉

Partager

Métriques

Consultations de la notice

325

Téléchargements de fichiers

484