Cover Image

Improvement of parallel strategy for listing all permutations using starter sets

Non-equivalence starter sets are employed to generate permutations.The starter sets are obtained using exchange operation strategy.In order to reduce the computation time for listing all permutations, the starter sets are allocated to different processors so that the task can be performed in paralle...

Full description

Saved in:
Bibliographic Details
Main Authors: Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda
Format: Conference or Workshop Item
Published: 2014
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://repo.uum.edu.my/16846/
http://doi.org/10.1063/1.4903572
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uum.repo.16846
record_format eprints
spelling my.uum.repo.168462016-05-19T01:38:59Z http://repo.uum.edu.my/16846/ Improvement of parallel strategy for listing all permutations using starter sets Karim, Sharmila Omar, Zurni Ibrahim, Haslinda QA75 Electronic computers. Computer science Non-equivalence starter sets are employed to generate permutations.The starter sets are obtained using exchange operation strategy.In order to reduce the computation time for listing all permutations, the starter sets are allocated to different processors so that the task can be performed in parallel.In this paper, an improved parallel strategy for distributing starter sets among processors is proposed.The numerical results reveal that this strategy not only improves the computation time but it also increases the efficiency of processors. 2014-08-12 Conference or Workshop Item PeerReviewed Karim, Sharmila and Omar, Zurni and Ibrahim, Haslinda (2014) Improvement of parallel strategy for listing all permutations using starter sets. In: 3rd International Conference on Quantitative Sciences and its Applications (ICOQSIA 2014), 12–14 August 2014, Langkawi, Kedah Malaysia. http://doi.org/10.1063/1.4903572 doi:10.1063/1.4903572
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/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Karim, Sharmila
Omar, Zurni
Ibrahim, Haslinda
Improvement of parallel strategy for listing all permutations using starter sets
description Non-equivalence starter sets are employed to generate permutations.The starter sets are obtained using exchange operation strategy.In order to reduce the computation time for listing all permutations, the starter sets are allocated to different processors so that the task can be performed in parallel.In this paper, an improved parallel strategy for distributing starter sets among processors is proposed.The numerical results reveal that this strategy not only improves the computation time but it also increases the efficiency of processors.
format Conference or Workshop Item
author Karim, Sharmila
Omar, Zurni
Ibrahim, Haslinda
author_facet Karim, Sharmila
Omar, Zurni
Ibrahim, Haslinda
author_sort Karim, Sharmila
title Improvement of parallel strategy for listing all permutations using starter sets
title_short Improvement of parallel strategy for listing all permutations using starter sets
title_full Improvement of parallel strategy for listing all permutations using starter sets
title_fullStr Improvement of parallel strategy for listing all permutations using starter sets
title_full_unstemmed Improvement of parallel strategy for listing all permutations using starter sets
title_sort improvement of parallel strategy for listing all permutations using starter sets
publishDate 2014
url http://repo.uum.edu.my/16846/
http://doi.org/10.1063/1.4903572
_version_ 1644282075249901568
score 13.160551

Similar Items