Improved Computing Performance for Listing Combinatorial Algorithms Using Multi-Processing MPI and Thread Library

This study builds up two parallel algorithms to improve computing performance for two listing binary andlisting permutation algorithms. The problems are extremely interesting and practically applicable in manyfields in our daily life. To parallel execution, we divide the data set input and allocate them to theprocessors. The article focuses on (i) the analysis of the research situation of the related works to compareand evaluate the existing problems of previous works, (ii) the analysis of the input data structure to dividedata for the sub processors, (iii) the construction of parallel algorithms - proof of correctness and analysisof computing complexity, and (iv) experiments in multi-processing MPI and Thread library. Then thecomparison of the results of the parallel algorithm with the sequential algorithm and the comparison of theexecution time on different sub processors is discussed.