A permutation parallel algorithm under exchange restriction with message passing interface
The permutation generation method is based on starter sets generation under exchange operation and exploited it for listing down all n! Permutations. However permutation generation is time consuming process, the implementation of sequential algorithm to parallel computation is the option for reducin...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://repo.uum.edu.my/15094/ http://doi.org/10.1063/1.4882458 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Utara Malaysia |
| Summary: | The permutation generation method is based on starter sets generation under exchange operation and exploited it for listing down all n! Permutations. However permutation generation is time consuming process, the implementation of sequential algorithm to parallel computation is the option for reducing the computation time. The sequential algorithm is implemented to a parallel algorithm by integrating with Message Passing Interface (MPI) libraries by paralleling the starter sets generation task.The speedup and efficiency is the indicator tool for analyzing performance of this parallel algorithm.The results show reduction time computation of parallel algorithm among processors. |
|---|