Portable List Ranking: an Experimental Study - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Journal of Experimental Algorithmics Year : 2002

Portable List Ranking: an Experimental Study


We present and analyze two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM). We report on implementations of these algorithms and experiments that were done with these on a variety of parallel and distributed architectures, ranging from PC clusters to a mainframe parallel machine. With these experiments, we validate the chosen CGM model, and also show the possible gains and limits of such algorithms.


Other [cs.OH]
No file

Dates and versions

inria-00100847 , version 1 (26-09-2006)



Isabelle Guérin Lassous, Jens Gustedt. Portable List Ranking: an Experimental Study. ACM Journal of Experimental Algorithmics, 2002, 7 (7), 18 p. ⟨10.1145/944618.944625⟩. ⟨inria-00100847⟩
122 View
0 Download



Gmail Facebook Twitter LinkedIn More