The Handling of Graphs on PC Clusters : A Coarse Grained Approach - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

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

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3897.pdf (123.28 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00072757 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072757 , version 1

Cite

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⟩
75 View
74 Download

Share

Gmail Facebook Twitter LinkedIn More