Feasability, Portability, Predictability and Efficiency : Four Ambitious Goals for the Design and Implementation of Parallel Coarse Grained Graph Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

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

Isabelle Guérin Lassous
Michel Morvan
  • Function : Author

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.
Fichier principal
Vignette du fichier
RR-3885.pdf (293.22 Ko) Télécharger le fichier
Loading...

Dates and versions

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

Identifiers

  • HAL Id : inria-00072768 , version 1

Cite

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⟩
60 View
203 Download

Share

Gmail Facebook Twitter LinkedIn More