Communication and Memory Optimized Tree Contraction and List Ranking - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2000

Communication and Memory Optimized Tree Contraction and List Ranking

Résumé

We present a simple and efficient algorithm for the Tree Contraction Problem on a Coarse Grained $p$-Multiprocessor. With respect to its total computing time, its demand of memory and its total inter-processor communication it is only a small constant factor away from optimality. Unless traditional PRAM algorithms it doesn't use List Ranking as a necessary subroutine but specializes to List Ranking when applied to lists.
Fichier principal
Vignette du fichier
RR-4061.pdf (99.99 Ko) Télécharger le fichier
Loading...

Dates et versions

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

Identifiants

  • HAL Id : inria-00072575 , version 1

Citer

Jens Gustedt. Communication and Memory Optimized Tree Contraction and List Ranking. [Research Report] RR-4061, INRIA. 2000, pp.9. ⟨inria-00072575⟩
45 Consultations
71 Téléchargements

Partager

Gmail Facebook X LinkedIn More