NobleBlocks

Research indexJournal article

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

Lau

Greater South Information System1 Jan 2018Open access

NobleIDark:/48914/w1/20260524/8BAB27C4DOI10.60692/dqx9v-rm702

Free to read at the publisher

You can read the abstract here, or the full text at the publisher.

Read at the publisher

Abstract

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

Discussion

Topics

More

Suggest a correction or report