Improving the efficiency of sparse matrix class processing by using the SPM-CSR parallel algorithm and OpenMP technology

The development of computationally efficient algorithms and the improvement of their software implementation are urgent issues that require continuous attention due to the ongoing development of computer system architecture. In multithreading systems bad coordination cause a big problems and give unwilling results. The purpose of the work is to improve performance of the parallel algorithm for sparse matrix multiplication in CSR format by using vector (SpMV-CSR) using OpenMP technology. Using OpenMP technology and reduction directive to solve sparse matrix time execution and bad coordination problem leads to execution time reduction and speed-up increase. Results obtained an acceleration increase of 14% when using reduction.