Is Your Permutation Algorithm Unbiased for n ≠ 2 m ?

Many papers on parallel random permutation algorithms assume the input size n to be a power of two and imply that these algorithms can be easily generalized to arbitrary n. We show that this simplifying assumption is not necessarily correct since it may result in a bias. Many of these algorithms are, however, consistent, i.e., iterating them ultimately converges against an unbiased permutation. We prove this convergence along with proving exponential convergence speed. Furthermore, we present an analysis of iterating applied to a butterfly permutation network, which works in-place and is well-suited for implementation on many-core systems such as GPUs. We also show a method that improves the convergence speed even further and yields a practical implementation of the permutation network on current GPUs.

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

[2]  David A. Bader,et al.  An Empirical Analysis of Parallel Random Permutation Algorithms ON SMPs , 2006, PDCS.

[3]  Josep Díaz,et al.  Algorithms — ESA '96 , 1996, Lecture Notes in Computer Science.

[4]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[5]  S. Holmes,et al.  Bootstrapping Phylogenetic Trees: Theory and Methods , 2003 .

[6]  Changbao Wu,et al.  Jackknife, Bootstrap and Other Resampling Methods in Regression Analysis , 1986 .

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

[8]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[9]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[10]  O. Perron Zur Theorie der Matrices , 1907 .

[11]  Douglas E. Soltis,et al.  Applying the Bootstrap in Phylogeny Reconstruction , 2003 .

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

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

[14]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[15]  Guy E. Blelloch,et al.  Prefix sums and their applications , 1990 .

[16]  Abdelhak M. Zoubir Model selection: a bootstrap approach , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).

[17]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[18]  F. Thomson Leighton,et al.  ARRAYS AND TREES , 1992 .