Fast Generation of Random Permutations via Networks Simulation

We consider the classical problem of generating random permutations with the uniform distribution. That is, we require that for an arbitrary permutation π of n elements, with probability 1/n! the machine halts with the ith output cell containing π(i), for 1≤i≤n. We study this problem on two models of parallel computations: the CREW PRAM and the EREW PRAM.

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

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

[3]  Allan Gottlieb,et al.  Complexity Results for Permuting Data and Other Computations on Parallel Processors , 1984, JACM.

[4]  Rüdiger Reischuk,et al.  Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs , 1994, J. Comput. Syst. Sci..

[5]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  Robert Sedgewick,et al.  Permutation Generation Methods , 1977, CSUR.

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

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

[9]  J. Reif,et al.  Parallel Tree Contraction Part 1: Fundamentals , 1989, Adv. Comput. Res..

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

[11]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[12]  Allan Borodin,et al.  Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

[13]  Ketan Mulmuley,et al.  Computational geometry - an introduction through randomized algorithms , 1993 .

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

[15]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[16]  Stephen A. Cook,et al.  Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..