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...
Saved in:
Main Authors: | Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/3587/1/S.pdf http://repo.uum.edu.my/3587/ http://dx.doi.org/10.1115/1.859735.paper40 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Improvement of parallel strategy for listing all permutations using starter sets
by: Karim, Sharmila, et al.
Published: (2014) -
Comparison between starter sets generation method for listing all permutations
by: Karim, Sharmila, et al.
Published: (2013) -
A permutation parallel algorithm under exchange restriction with message passing interface
by: Karim, Sharmila, et al.
Published: (2014) -
SEALiP: A simple and efficient algorithm for listing permutation via starter set method
by: Ibrahim, Haslinda, et al.
Published: (2013) -
New recursive circular algorithm for listing all permutations
by: Karim, Sharmila, et al.
Published: (2014)