Pfair scheduling improvement to reduce interprocessor migrations

Abstract : Proportionate-fair (Pfair) scheduling is a particulary promising global scheduling technique for multiprocessor systems. Actually three Pfair scheduling algorithms have been proved optimal for scheduling periodic, sporadic and rate-based tasks on a real-time multiprocessor. However, task migration is unrestricted under Pfair scheduling. In the worst case, a task may be migrated each time it is scheduled. To correct this problem, we propose to complement initial Pfair scheduling algorithm by some heuristics that strive to minimize the total number of migrations. Experimental simulations are presented to evaluate and compare the proposed heuristics and we show that the number of migrations can be substantially reduced by adding these simple rules.
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

https://hal.inria.fr/inria-00336513
Contributeur : Anne Jaigu <>
Soumis le : mardi 4 novembre 2008 - 13:01:57
Dernière modification le : mercredi 16 mai 2018 - 11:48:02
Document(s) archivé(s) le : lundi 7 juin 2010 - 22:44:17

Fichier

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

Identifiants

  • HAL Id : inria-00336513, version 1

Collections

Citation

Dalia Aoun, Anne-Marie Déplanche, Yvon Trinquet. Pfair scheduling improvement to reduce interprocessor migrations. Giorgio Buttazzo and Pascale Minet. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Oct 2008, Rennes, France. 2008. 〈inria-00336513〉

Partager

Métriques

Consultations de la notice

209

Téléchargements de fichiers

317