Minimizing the number of processors for real-time distributed systems

Abstract : In this paper we present a new search method for partitioning and scheduling a set of periodic tasks on a multiprocessor or distributed architecture. The schedule is fixedpriority driven and task migration is not allowed. The aim of this algorithm is to minimize the number of processors used for scheduling a set of tasks. Moreover, we assume that the number of processors obtained by our method is optimal in respect to the holistic analysis. The paper then compares experimental results from the presented method to the FBB-FFD [9] partitioning algorithm in a multiprocessor context.
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 [28 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00336511
Contributeur : Anne Jaigu <>
Soumis le : mardi 4 novembre 2008 - 12:57:35
Dernière modification le : mardi 4 novembre 2008 - 13:50:31
Document(s) archivé(s) le : lundi 7 juin 2010 - 22:43:49

Fichier

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

Identifiants

  • HAL Id : inria-00336511, version 1

Collections

Citation

François Dorin, Michael Richard, Emmanuel Grolleau, Pascal Richard. Minimizing the number of processors for real-time distributed systems. Giorgio Buttazzo and Pascale Minet. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Oct 2008, Rennes, France. 2008. 〈inria-00336511〉

Partager

Métriques

Consultations de la notice

133

Téléchargements de fichiers

116