Parallel Generation of Permutations
Parth Gupta · The Computer Journal · 1983
A parallel algorithm to generate all the nPr distinct permutations of r items out of n distinct items is presented in this paper. The algorithm requires O([nPr/P ⌉rlog2r) units of time when P processors are available in the SIMD computer.