Parallel strategy for starter sets to list all permutation based on cycling restriction
This paper presents a parallel implementation of a new permutation generation method.This permutation generation method is based on the starter sets for listing all the n! permutations.The sequential algorithm is developed and parallelized for parallel computing by integrating with Message Passing...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/3587/1/S.pdf |
| Summary: | This paper presents a parallel implementation of a new permutation generation method.This permutation generation method is based on the starter sets for listing all the n! permutations.The sequential algorithm is developed and
parallelized for parallel computing by integrating with Message Passing Interface (MPI) libraries. The performance of the parallel algorithms is presented to demonstrate the validation of the works. |
|---|