Efficient parallel algorithm for listing permutation with Message Passing Interface (MPI)

An efficient parallel algorithm for a new permutation generation method is presented. The crucial task in our permutation generation algorithm is starter sets generation where listing n! permutation is dependent on starter sets. Thus the task of starter sets generation is partitioned. However the parallel algorithm with 12 initial starter sets is less efficient when numbers of processors are more than seven. For increasing performance of parallel algorithm over processors, the number of initial starter sets change to 60. This parallel algorithm is directly implemented from its sequential algorithm and integrated with Message Passing Interface (MPI) libraries. The improvement of the parallel algorithm is shown better performance in terms of speedup and efficiency.