Feasability, Portability, Predictability and Efficiency : Four Ambitious Goals for the Design and Implementation of Parallel Coarse Grained Graph Algorithms

Isabelle Guérin Lassous Jens Gustedt 1 Michel Morvan
1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We study the relationship between the design and analysis of graph algorithms in the coarsed grained parallel models and the behavior of the resulting code on todays parallel machines and clusters. We conclude that the coarse grained multicomputer model (CGM) is well suited to design competitive algorithms, and that it is thereby now possible to aim to develop portable, predictable and efficient parallel algorithms code for graph problems.
Type de document :
Rapport
[Research Report] RR-3885, INRIA. 2000, pp.34
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00072768
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 10:50:52
Dernière modification le : dimanche 20 mai 2018 - 20:20:10
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:21:34

Fichiers

Identifiants

  • HAL Id : inria-00072768, version 1

Collections

Citation

Isabelle Guérin Lassous, Jens Gustedt, Michel Morvan. Feasability, Portability, Predictability and Efficiency : Four Ambitious Goals for the Design and Implementation of Parallel Coarse Grained Graph Algorithms. [Research Report] RR-3885, INRIA. 2000, pp.34. 〈inria-00072768〉

Partager

Métriques

Consultations de la notice

167

Téléchargements de fichiers

180