Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

Cited literature [55 references]  Display  Hide  Download

https://hal.inria.fr/inria-00072768
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:50:52 AM
Last modification on : Friday, February 26, 2021 - 3:28:07 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:21:34 PM

Identifiers

  • 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⟩

Share

Metrics

Record views

187

Files downloads

228