HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Portable List Ranking: an Experimental Study

Isabelle Guérin Lassous 1, 2 Jens Gustedt 3
2 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM) and we report on experimental studies of these algorithms. With these experiments, we study the validity of the chosen CGM model, and also show the possible gains and limits of such algorithms.
Complete list of metadata

Contributor : Jens Gustedt Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:53:34 AM
Last modification on : Friday, February 4, 2022 - 3:10:30 AM

Links full text



Isabelle Guérin Lassous, Jens Gustedt. Portable List Ranking: an Experimental Study. WAE 2000 - Workshop on Algorithm Engineering, 2000, Saarbrücken, Germany. pp.111-122, ⟨10.1007/3-540-44691-5_10⟩. ⟨inria-00099383⟩



Record views