List Ranking on a Coarse Grained Multiprocessor

Isabelle Guérin Lassous Jens Gustedt 1
1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present a deterministic algorithm for the List Ranking Problem on a Coarse Grained p-Multiprocessor (CGM) that is only a factor of log*(p) away from optimality. This statement holds as well for counting communication rounds where it achieves O(log(p) log*(p)) and for the required communication cost and total computation time where it achieves O(n log*(p)). We report on experimental studies of that algorithm on a variety of platforms that show the validity of the chosen CGM-model, and also show the possible gains and limits of such an algorithm. Finally, we suggest to extend CGM model by the communication blow up to allow better a priori predictions of communication costs of algorithms.
Type de document :
[Research Report] RR-3640, INRIA. 1999, pp.14
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:40:17
Dernière modification le : dimanche 20 mai 2018 - 20:20:10
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:31:55



  • HAL Id : inria-00073033, version 1



Isabelle Guérin Lassous, Jens Gustedt. List Ranking on a Coarse Grained Multiprocessor. [Research Report] RR-3640, INRIA. 1999, pp.14. 〈inria-00073033〉



Consultations de la notice


Téléchargements de fichiers