Practical Parallel List Ranking

Journal of Parallel and Distributed Computing

Volumn 56, Issue 2, 1999, Pages 156-180

  Sibeyn, Jop F ^a   Guillaume, Frank ^a   Seidel, Tillmann ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Algorithms; Implementations; Parallel list ranking; Routing operations; Speed up

Indexed keywords

EID: 0000694519     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1998.1508     Document Type: Article

References (18)

1. Anderson R. J., Miller G. L. Deterministic parallel list ranking. Algorithmica. 6:1991;859-868.
2. Atallah M. J., Hambrusch S. E. Solving tree problems on a mesh-connected processor array. Inform. and Control. 69:1986;168-187.
3. Cole R., Vishkin U. Deterministic coin tossing with applications to optimal parallel list ranking. Inform. and Control. 70:1986;32-53.
4. Gibbons A. M., Srikant Y. N. A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation. Inform. Process. Lett. 32:1989;305-311.
5. Hagerup T., Rüb C. A guided tour of Chernoff bounds. Inform. Process. Lett. 33:1990;305-308.
6. Hsu T.-s., Ramachandran V. Efficient massively parallel implementation of some combinatorial algorithms. Theoret. Comput. Sci. 162:1996;297-322.
7. JáJá J. An Introduction to Parallel Algorithms. 1992;Addison-Wesley, Reading.
8. Juurlink B., Rao P. S., Sibeyn J. F. Gossiping on meshes and tori. Proceedings, 2nd Euro-Par Conference. Lecture Notes in Computer Science. 1123:1996;Springer-Verlag, Berlin/New York. p. 361-369.
9. Karp R., Luby M., Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. Algorithmica. 16:1996;517-542.
10. LaMarca A., Ladner R. E. The influences of caches on the performance of sorting. Proceedings, Symposium on Discrete Algorithms. 1997;ACM/SIAM, New York/Philadelphia. p. 370-379.
11. Liu L. T., Culler D. E. Evaluation of the Intel Paragon on active message communication. Proceedings, Intel Supercomputer Users Group Conference. 1995.
12. McCalpin J. D. Memory bandwidth and machine balance in current high performance computers. IEEE Technical Committee on Computer Architecture Newsletter. 12:1995;19-25.
13. Mehlhorn K., Vishkin U. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Inform. 9:1984;29-59.
14. Pietracaprina A., Pucci G., Sibeyn J. F. Constructive deterministic PRAM simulation on a mesh-connected computer. Proceedings, 6th Symposium on Parallel Algorithms and Architectures. 1994;ACM, New York. p. 248-256.
15. Reid-Miller M. List ranking and list scan on the Cray C-90. J. Comput. Syst. Sci. 53:1996;344-356.
16. Reid-Miller M., Miller G. L., Modugno F. List-ranking and parallel tree contraction. Synthesis of Parallel Algorithms. 1993;Morgan Kaufmann, San Mateo. p. 115-194.
17. Ryu K. W., JáJá J. Efficient algorithms for list ranking and for solving graph problems on the hypercube. IEEE Trans. Parallel Distrib. Syst. 1:1990;83-90.
18. Sibeyn J. F. List ranking on interconnection networks. Proceedings, 2nd Euro-Par Conference. Lecture Notes in Computer Science. 1123:1996;Springer-Verlag. p. 799-808.