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...

Full description

Bibliographic Details
Main Authors: Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar
Format: Conference or Workshop Item
Language:English
Published: 2011
Subjects:
Online Access:https://repo.uum.edu.my/id/eprint/3587/1/S.pdf
_version_ 1803624688274898944
author Karim, Sharmila
Omar, Zurni
Ibrahim, Haslinda
Othman, Khairil Iskandar
author_facet Karim, Sharmila
Omar, Zurni
Ibrahim, Haslinda
Othman, Khairil Iskandar
author_sort Karim, Sharmila
collection UUM
description 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.
first_indexed 2024-07-04T05:22:21Z
format Conference or Workshop Item
id uum-3587
institution Universiti Utara Malaysia
language English
last_indexed 2024-07-04T05:22:21Z
publishDate 2011
record_format dspace
spelling uum-35872011-11-23T04:30:10Z https://repo.uum.edu.my/id/eprint/3587/ Parallel strategy for starter sets to list all permutation based on cycling restriction Karim, Sharmila Omar, Zurni Ibrahim, Haslinda Othman, Khairil Iskandar QA76 Computer software 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. 2011 Conference or Workshop Item PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/3587/1/S.pdf Karim, Sharmila and Omar, Zurni and Ibrahim, Haslinda and Othman, Khairil Iskandar (2011) Parallel strategy for starter sets to list all permutation based on cycling restriction. In: International Conference on Computer Engineering and Technology, 3rd (ICCET 2011), 17-19 June 2011, Kuala Lumpur, Malaysia. http://dx.doi.org/10.1115/1.859735.paper40
spellingShingle QA76 Computer software
Karim, Sharmila
Omar, Zurni
Ibrahim, Haslinda
Othman, Khairil Iskandar
Parallel strategy for starter sets to list all permutation based on cycling restriction
title Parallel strategy for starter sets to list all permutation based on cycling restriction
title_full Parallel strategy for starter sets to list all permutation based on cycling restriction
title_fullStr Parallel strategy for starter sets to list all permutation based on cycling restriction
title_full_unstemmed Parallel strategy for starter sets to list all permutation based on cycling restriction
title_short Parallel strategy for starter sets to list all permutation based on cycling restriction
title_sort parallel strategy for starter sets to list all permutation based on cycling restriction
topic QA76 Computer software
url https://repo.uum.edu.my/id/eprint/3587/1/S.pdf
work_keys_str_mv AT karimsharmila parallelstrategyforstartersetstolistallpermutationbasedoncyclingrestriction
AT omarzurni parallelstrategyforstartersetstolistallpermutationbasedoncyclingrestriction
AT ibrahimhaslinda parallelstrategyforstartersetstolistallpermutationbasedoncyclingrestriction
AT othmankhairiliskandar parallelstrategyforstartersetstolistallpermutationbasedoncyclingrestriction