An Empirical Analysis of Parallel Random Permutation Algorithms ON SMPs

This work was supported in part by NSF Grants CAREER ACI-00-93039, NSF DBI-0420513, ITR ACI-00- 81404, DEB-99-10123, ITR EIA-01-21377, Biocomplexity DEB-01-20709, and ITR EF/BIO 03-31654; and DARPA Contract NBCH30390004.

[1]  David A. Bader,et al.  SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs) , 1998, J. Parallel Distributed Comput..

[2]  John H. Reif,et al.  An optimal parallel algorithm for integer sorting , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[3]  M. MANOHAR,et al.  Connected component labeling of binary images on a mesh connected massively parallel processor , 1989, Comput. Vis. Graph. Image Process..

[4]  Richard J. Anderson.  Parallel algorithms for generating random permutations on a shared memory machine , 1990, SPAA '90.

[5]  Torben Hagerup.  Fast Parallel Generation of Random Permutations , 1991, ICALP.

[6]  Joseph JáJá,et al.  Designing Practical Efficient Algorithms for Symmetric Multiprocessors , 1999, ALENEX.

[7]  Artur Czumaj,et al.  Fast Generation of Random Permutations via Networks Simulation , 1996, ESA.

[8]  Donald E. Knuth.  The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .

[9]  David A. Bader,et al.  Lock-Free Parallel Algorithms: An Experimental Study , 2004, HiPC.

[10]  Isabelle Guérin Lassous,et al.  Generating Random Permutation in the Framework of Coarse Grained Models , 2000, OPODIS.

[11]  Yossi Matias,et al.  Efficient low-contention parallel algorithms , 1994, SPAA '94.

[12]  Makoto Matsumoto,et al.  Twisted GFSR generators , 1992, TOMC.

[13]  Peter Sanders,et al.  Random Permutations on Distributed, External and Hierarchical Memory , 1998, Inf. Process. Lett..

[14]  Artur Czumaj,et al.  Fast Generation of Random Permutations Via Networks Simulation , 1998, Algorithmica.

[15]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[16]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[17]  Uzi Vishkin,et al.  Converting high probability into nearly-constant time—with applications to parallel hashing , 1991, STOC '91.

[18]  Dennis J. Volper,et al.  Geometric retrieval in parallel , 1988 .

[19]  Sanguthevar Rajasekaran,et al.  Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms , 1989, SIAM J. Comput..

[20]  Joseph Gil,et al.  Fast load balancing on a PRAM , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.