Parallel permutation generation on linear array

  title={Parallel permutation generation on linear array},
  author={Chau-Jy Lin},
  journal={Int. J. Comput. Math.},
  • Chau-Jy Lin
  • Published 1991
  • Mathematics, Computer Science
  • Int. J. Comput. Math.
Given n items, a parallel algorithm for generating all the n! permutations is presented. The computational model used is a linear array which consists of n identical processing elements with a simple structure. One permutation is produced at each other time step. The elapsed time to produce a permutation is independent of the integer n. The basic idea used is the iterative method and the exchange of two consecutive components in an existing permutation. The design procedures of this algorithm… Expand
6 Citations
A New Method for Generating Permutations in Lexicographic Order
  • 10
  • PDF
Efficient parallel algorithm for listing permutation with Message Passing Interface (MPI)
The Generation of $(n,n(n-1),n-1)$ Permutation Group Codes for Communication Systems
  • L. Peng
  • Mathematics, Computer Science
  • IEEE Transactions on Communications
  • 2019
  • 3


Parallel generation of permutations and combinations
  • 39
A new algorithm for generation of permutations
  • S. Zaks
  • Mathematics, Computer Science
  • BIT Comput. Sci. Sect.
  • 1984
  • 41
Permutation Generation on Vector Processors
  • 21
  • PDF
Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
  • S. Akl
  • Computer Science, Mathematics
  • Comput. J.
  • 1987
  • 40
  • PDF
Permutation Generation Methods
  • 248
  • PDF
Why systolic architectures?
  • 2,206
  • PDF
Parallel Generation of Permutations
  • 29
  • PDF