Portable list ranking: an experimental study

  • Authors:
  • Isabelle Guérin Lassous;Jens Gustedt

  • Affiliations:
  • INRIA Rhône-Alpes, LIP, ENS Lyon, 46, allée d'Italie, 69007 Lyon, France;LORIA and INRIA Lorraine Campus scientifique, BP 239, 54506 Vandœuvre-lès-Nancy France

  • Venue:
  • Journal of Experimental Algorithmics (JEA)
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.