On the complexity of optimal priority assignment for periodic tasks upon identical processors

Liliana Cucu 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we study global fixed-priority scheduling of periodic task systems upon identical multiprocessor platforms. Based on existing feasibility tests for periodic task systems upon identical multiprocessor platforms, we show (using a dummy priority assignment algorithm) that optimal priority assignment for these systems exists. Then we provide an algorithm based on RMUS[m/(3m-2)] that has lower complexity. Finally, we conjuncture that, contrary to the general opinion, (pseudo-) polynomial optimal priority assignment algorithms for periodic task systems upon identical processors might exist.
Type de document :
Communication dans un congrès
Marco Caccamo. 20th Euromicro Conference on Real-time Systems (ECRTS'08), Work-in-Progress session, 2008, Prague, Czech Republic. 2008
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00334705
Contributeur : Liliana Cucu <>
Soumis le : lundi 27 octobre 2008 - 15:40:33
Dernière modification le : jeudi 11 janvier 2018 - 06:20:05
Document(s) archivé(s) le : mardi 9 octobre 2012 - 14:30:52

Fichier

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

Identifiants

  • HAL Id : inria-00334705, version 1

Collections

Citation

Liliana Cucu. On the complexity of optimal priority assignment for periodic tasks upon identical processors. Marco Caccamo. 20th Euromicro Conference on Real-time Systems (ECRTS'08), Work-in-Progress session, 2008, Prague, Czech Republic. 2008. 〈inria-00334705〉

Partager

Métriques

Consultations de la notice

202

Téléchargements de fichiers

304