Abstract

A permutation is a mathematical technique for determining the number of possible arrangements in any set where the particular sequence of the arrangements matter. Computation of permutations of a string is a complex task, especially for long strings, and it frequently takes a long time. To address this issue, parallelization becomes critical to explore the vast solution space efficiently. In this paper, the parallelized solution for generating string permutations using the Message Passing Interface (MPI) programming model is discussed. The proposed algorithm divides the workload among multiple processors to render a subset of total permutations. Through a comparative analysis with a sequential approach, the performance of the parallel algorithm is evaluated. The findings emphasize the potential advantages of parallelization in reducing the overall computation time for string permutation generation.