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 …

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 …

We compare parallel algorithms for random permutation generation on symmetric
multiprocessors (SMPs). Algorithms considered are the sorting-based algorithm, Anderson's …

This article introduces an algorithm, MergeShuffle, which is an extremely efficient algorithm
to generate random permutations (or to randomly permute an existing array). It is easy to …

We tackle the feasibility and efficiency of two new parallel algorithms that sample random
permutations of the integers [M]={1,..., M}. The first reduces the communication for p …

We consider the problem of generating random permutations with uniform distribution. That
is, we require that for an arbitrary permutation π of n elements, with probability 1/n! the …

We show how to uniformly distribute data at random (not to be confounded with permutation
routing) in two settings that are able to deal with massive data: coarse grained parallelism …

The Discrete Memory Machine (DMM) is a theoretical parallel computing model that
captures the essence of the shared memory access of GPUs. Bank conflicts should be …

We study the problem of generating random permutations, ie, of drawing random elements
from the uniform distribution over the set of all permutations of a finite set. Our results are the …

Permutation is the different arrangements that can be made with a given number of things
taking some or all of them at a time. The notation P (n, r) is used to denote the number of …