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...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2014
|
| Subjects: |
| _version_ | 1825803777003749376 |
|---|---|
| author | Karim, Sharmila Omar, Zurni Ibrahim, Haslinda |
| author_facet | Karim, Sharmila Omar, Zurni Ibrahim, Haslinda |
| author_sort | Karim, Sharmila |
| collection | UUM |
| 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. |
| first_indexed | 2024-07-04T06:03:21Z |
| format | Conference or Workshop Item |
| id | uum-16846 |
| institution | Universiti Utara Malaysia |
| last_indexed | 2024-07-04T06:03:21Z |
| publishDate | 2014 |
| record_format | eprints |
| spelling | uum-168462016-05-19T01:38:59Z https://repo.uum.edu.my/id/eprint/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 doi:10.1063/1.4903572 |
| spellingShingle | QA75 Electronic computers. Computer science Karim, Sharmila Omar, Zurni Ibrahim, Haslinda Improvement of parallel strategy for listing all permutations using starter sets |
| title | 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_short | Improvement of parallel strategy for listing all permutations using starter sets |
| title_sort | improvement of parallel strategy for listing all permutations using starter sets |
| topic | QA75 Electronic computers. Computer science |
| work_keys_str_mv | AT karimsharmila improvementofparallelstrategyforlistingallpermutationsusingstartersets AT omarzurni improvementofparallelstrategyforlistingallpermutationsusingstartersets AT ibrahimhaslinda improvementofparallelstrategyforlistingallpermutationsusingstartersets |