List Ranking on a Coarse Grained Multiprocessor - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

List Ranking on a Coarse Grained Multiprocessor

Isabelle Guérin Lassous


We present a deterministic algorithm for the List Ranking Problem on a Coarse Grained p-Multiprocessor (CGM) that is only a factor of log*(p) away from optimality. This statement holds as well for counting communication rounds where it achieves O(log(p) log*(p)) and for the required communication cost and total computation time where it achieves O(n log*(p)). We report on experimental studies of that algorithm on a variety of platforms that show the validity of the chosen CGM-model, and also show the possible gains and limits of such an algorithm. Finally, we suggest to extend CGM model by the communication blow up to allow better a priori predictions of communication costs of algorithms.
Fichier principal
Vignette du fichier
RR-3640.pdf (147.74 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00073033 , version 1


Isabelle Guérin Lassous, Jens Gustedt. List Ranking on a Coarse Grained Multiprocessor. [Research Report] RR-3640, INRIA. 1999, pp.14. ⟨inria-00073033⟩
157 View
18017 Download


Gmail Facebook Twitter LinkedIn More