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: |
| Summary: | 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. |
|---|