Skip to Main content Skip to Navigation
Journal articles

Portable List Ranking: an Experimental Study

Isabelle Guérin Lassous 1 Jens Gustedt 2
1 ARES - Architectures of networks of services
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
2 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Jens Gustedt <>
Submitted on : Tuesday, September 26, 2006 - 2:52:25 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM


  • HAL Id : inria-00100847, version 1


Isabelle Guérin Lassous, Jens Gustedt. Portable List Ranking: an Experimental Study. ACM Journal of Experimental Algorithmics, Association for Computing Machinery, 2002, 7 (7), 18 p. ⟨inria-00100847⟩



Record views