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
2 RESEDAS - Software Tools for Telecommunications and Distributed Systems

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.

Mots clés: PARALLEL GRAPH ALGORITHMS; PARALLEL MODELS; CGM; CLUSTERS; EXPERIMENTS

Domaines: Autre [cs.OH]

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⟩