Generating permutation can be done in many ways. One of them is via starter sets which are obtained using exchange operation strategy and exploit them to list down all permutations. It was found that the process of generating permutations requires lengthy time. However, this drawback can be overcome by running the task using several processors. In this study, a technique of parallelization across the method was employed to develop new parallel algorithm for finding all permutations under exchanged restrictions. The numerical results reveal that the new approach is efficient only for case when the number of initial starter sets is equally divisible.
展开▼
