 | The ACM Journal of Experimental Algorithmics |
Volume 7, Article 7, 2002
Portable List Ranking: An Experimental Study
by
and
http://www.jea.acm.org/2002/GuerinRanking/
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.
- Sources:
- The LaTeX version of the article;
this is a Unix file that contains the LaTeX source;
note that you must be a subscriber (institutional or individual) to access this file.
- The Postscript
version or PDF
version of the article;
note that you must be a subscriber (institutional or individual) to access
these files.
- The HTML version of the article;
note that you must be a subscriber (institutional or individual) to access
this file.
- The bibliography given in the article.
Received
|
Accepted
|
Final Revision
|
Published
|
|
|
|
|
Last updated and validated May 11, 2002, by editor@jea.acm.org