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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Caceres, E., Dehne, F., Ferreira, A., Flocchini, P., Rieping, I., Roncato, A., Santoro, N., and Song, S. W. (1997). Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Degano, P., Gorrieri, R., and Marchetti-Spaccamela, A., editors, Automata, Languages and Programming, volume 1256 of Lecture Notes in Comp. Sci., pages 390–400. Springer-Verlag. Proceedings of the 24th International Colloquium ICALP’97.
Cole, R. and Vishkin, U. (1989). Faster optimal prefix sums and list ranking. Information and Computation, 81(3):128–142.
Dehne, F., Fabri, A., and Rau-Chaplin, A. (1996). Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379–400.
Dehne, F. and Song, S. W. (1996). Randomized parallel list ranking for distributed memory multiprocessors. In Jaffar, J. and Yap, R. H. C., editors, Concurrency and Parallelism, Programming, Networking, and Security, volume 1179 of Lecture Notes in Comp. Sci., pages 1–10. Springer-Verlag. Proceedings of the Asian Computer Science Conference (ASIAN’ 96).
Guérin Lassous, I., Gustedt, J., and Morvan, M. (2000). Feasibility, portability, predictability and efficiency: Four ambitious goals for the design and implementation of parallel coarse grained graph algorithms. Technical Report 3885, INRIA.
Guérin Lassous, I. and Gustedt, J. (1999). List ranking on a coarse grained multiprocessor. Technical Report RR-3640, INRIA.
Guérin Lassous, I. and Gustedt, J. (2000). List ranking on pc clusters. Technical Report RR-3869, INRIA Lorraine. http://www.inria.fr/RRRT/publications-fra.html.
Jájá, J. (1992). An Introduction to Parallel Algorithms. Addison Wesley.
Karp, R. M. and Ramachandran, V. (1990). Parallel Algorithms for Shared-Memory Machines. In van Leeuwen, J., editor, Handbook of Theoretical Computer Science, volume A, Algorithms and Complexity, pages 869–941. Elsevier Science Publishers B.V., Amsterdam.
Reid-Miller, M. (1994). List ranking and list scan on the Cray C-90. In Proc. ACM Symp. on Parallel Algorithms and Architectures, pages 104–113.
Sibeyn, J. F., Guillaume, F., and Seidel, T. (1999). Practical Parallel List Ranking. Journal of Parallel and Distributed Computing, 56:156–180.
Sibeyn, J. (1997). Better trade-offs for parallel list ranking. In Proc. of 9th ACM Symposium on Parallel Algorithms and Architectures, pages 221–230.
Valiant, L. G. (1990). A bridging model for parallel computation. Communications of the ACM, 33(8):103–111.
Wyllie, J. C. (1979). The Complexity of Parallel Computations. PhD thesis, Computer Science Department, Cornell University.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guérin Lassous, I., Gustedt, J. (2001). Portable List Ranking: An Experimental Study. In: Näher, S., Wagner, D. (eds) Algorithm Engineering. WAE 2000. Lecture Notes in Computer Science, vol 1982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44691-5_10
Download citation
DOI: https://doi.org/10.1007/3-540-44691-5_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42512-0
Online ISBN: 978-3-540-44691-0
eBook Packages: Springer Book Archive