• DOI:10.1080/00207169108803963
Corpus ID: 122801095

Parallel permutation generation on linear array

@article{Lin1991ParallelPG,
  title={Parallel permutation generation on linear array},
  author={Chau-Jy Lin},
  journal={Int. J. Comput. Math.},
  year={1991},
  volume={38},
  pages={113-121}
}

• 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

View via Publisher

Save to Library

Create Alert

Cite

Launch Research Feed