OPENMP PARALLEL CALCULATIONS IN ALGORITHMS FOR SOLVING SHORTEST PATHS PROBLEM
O.Y. Lavlinskaya, V.V. Bernikov, O.N. Grigorova
The relevance of the study is due to the need to solve the problems of parallelization of calculations for the class of NP-complete problems, since computing power allows the use of parallel flows and reduce the computation time and energy consumption to obtain a complex computational result using software technologies of parallelization of calculations. In this regard, this article aims to publish the results of the study, based on the analysis of empirical data, proving the effectiveness of parallel calculations for the class of NP-complete problems. The article compares the work of a single-threaded application and multithreaded applications using OpenMP technology, on the example of the Floyd-Warshall Algorithm for finding the shortest path. During the experiment, data on the speed of serial and parallel algorithms were obtained. It is concluded that the parallel algorithm is more efficient than the serial one. With the growth of the computational power of the algorithm, the efficiency of parallel computing increases. The experiment was carried out for calculations at different power of a set of initial data, the data are presented in the form of tables and graphs. Evaluate the effectiveness of the use of standard parallelization and OpenMP. The materials of the article are of practical importance for master’s students studying the course “Computer systems”, can be used to solve applied optimization problems.
Keywords: :OpenMP, parallelization, search of ways, Floyd- Warshall algorithm.