Skip to Main content Skip to Navigation

The Handling of Graphs on PC Clusters : A Coarse Grained Approach

Isabelle Guérin Lassous 1 Jens Gustedt 2 Michel Morvan
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
2 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 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 code for graph problems on clusters.
Document type :
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:49:18 AM
Last modification on : Friday, February 26, 2021 - 3:28:07 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:21:13 PM


  • HAL Id : inria-00072757, version 1



Isabelle Guérin Lassous, Jens Gustedt, Michel Morvan. The Handling of Graphs on PC Clusters : A Coarse Grained Approach. [Research Report] RR-3897, INRIA. 2000. ⟨inria-00072757⟩



Record views


Files downloads