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.
Type de document :
Article dans une revue
ACM Journal of Experimental Algorithmics, 2002, 7 (7), 18 p
Liste complète des métadonnées

Contributeur : Jens Gustedt <>
Soumis le : mardi 26 septembre 2006 - 14:52:25
Dernière modification le : samedi 27 octobre 2018 - 01:19:57


  • HAL Id : inria-00100847, version 1



Isabelle Guérin Lassous, Jens Gustedt. Portable List Ranking: an Experimental Study. ACM Journal of Experimental Algorithmics, 2002, 7 (7), 18 p. 〈inria-00100847〉



Consultations de la notice