Cover Image

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

Saved in:
Bibliographic Details
Main Authors: Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar
Format: Conference or Workshop Item
Language:English
Published: 2011
Subjects:
QA76 Computer software
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!
id my.uum.repo.3587
record_format eprints
spelling my.uum.repo.35872011-11-23T04:30:10Z http://repo.uum.edu.my/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 http://repo.uum.edu.my/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
institution Universiti Utara Malaysia
building UUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Utara Malaysia
content_source UUM Institutionali Repository
url_provider http://repo.uum.edu.my/
language English
topic QA76 Computer software
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
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.
format Conference or Workshop Item
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
title 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_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_sort parallel strategy for starter sets to list all permutation based on cycling restriction
publishDate 2011
url http://repo.uum.edu.my/3587/1/S.pdf
http://repo.uum.edu.my/3587/
http://dx.doi.org/10.1115/1.859735.paper40
_version_ 1644278544442851328
score 13.160551

Similar Items