# A fast probabilistic parallel sorting algorithm

TL;DR: A probabilistic parallel algorithm to sort n keys drawn from some arbitrary total ordered set such that the average runtime is bounded by O(log n), which means the product of time and number of processors meets the information theoretic lower bound for sorting.

Abstract: We describe a probabilistic parallel algorithm to sort n keys drawn from some arbitrary total ordered set. This algorithm can be implemented on a parallel computer consisting of n RAMs, each with small private memory, and a common memory of size O(n) such that the average runtime is bounded by O(log n). Hence for this algorithm the product of time and number of processors meets the information theoretic lower bound for sorting.

...read more

##### Citations

^{1}

332 citations

### Cites methods from "A fast probabilistic parallel sorti..."

...Reischuk [24] has used a probabilistic result that is a one-dimensional analog of Lemma 4....

[...]

290 citations

242 citations

211 citations

134 citations

##### References

399 citations

313 citations

166 citations