List Ranking on PC Clusters - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

List Ranking on PC Clusters

Isabelle Guérin Lassous


We present two algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM for short): if $p$ is the number of processors and $n$ the size of the list, then we give a deterministic one that achieves $O(\log p \log^* p)$ communication rounds and $O(n \log^* p)$ for the required communication cost and total computation time; and a randomized one that requires $O(\log p)$ communication rounds and $O(n)$ for the required communication cost and total computation time. We report on experimental studies of these algorithms on a PC cluster interconnected by a Myrinet network. As far as we know, it is the first portable code on this problem that runs on a cluster. With these experimental studies, we study the validity of the chosen CGM-model, and also show the possible gains and limits of such algorithms for PC clusters.


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

Dates and versions

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


  • HAL Id : inria-00072785 , version 1


Isabelle Guérin Lassous, Jens Gustedt. List Ranking on PC Clusters. [Research Report] RR-3869, INRIA. 2000, pp.14. ⟨inria-00072785⟩
140 View
148 Download


Gmail Facebook Twitter LinkedIn More