mailto:uumlib@uum.edu.my 24x7 Service; AnyTime; AnyWhere

Improvement of parallel strategy for listing all permutations using starter sets

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.

Full text not available from this repository. (Request a copy)

Abstract

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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: ISBN: 978-0-7354-1274-3
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: School of Quantitative Sciences
Depositing User: Dr. Sharmila Karim
Date Deposited: 07 Jan 2016 04:40
Last Modified: 19 May 2016 01:38
URI: https://repo.uum.edu.my/id/eprint/16846

Actions (login required)

View Item View Item