OPTIMIZING THE OPERATION OF FRAGMENTED PROGRAMS BASED ON TRACES

Abstract

This article analyzes a fragmented algorithm to solve systems of linear algebraic equations and optimize its operation. A sequential and parallel algorithm of the generalized minimal residuals method is described. A fragmented algorithm has been developed and implemented in the LuNA language. The LuNA system automatically constructs parallel programs, thereby allowing researchers not to waste efforts on developing a parallel program, in particular, allows not to take into consideration the communication processes between computer nodes and information about which nodes store distributed data, perform calculations. To optimize the operation of the fragmented program, the trace playback module was used, using data from the previous operation of the program to bypass additional costs in the further construction of parallel programs. The program was tested on the cluster of the Information and Computing Center of Novosibirsk State University and the results were analyzed. With the help of trace playback, at best, an acceleration of 27 times was obtained.

Author Biographies

Danil Lebedev, Astana IT University, Astana, Kazakhstan
Vladislav Perepelkin, Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk, Russian Federation
How to Cite
LEBEDEV, Danil; PEREPELKIN, Vladislav. OPTIMIZING THE OPERATION OF FRAGMENTED PROGRAMS BASED ON TRACES. Journal of problems in computer science and information technologies, [S.l.], v. 1, n. 1, mar. 2023. ISSN 2958-0846. Available at: <https://dslib.kaznu.kz/index.php/kaznu/article/view/JPCSIT.2023.v1.i1.03>. Date accessed: 22 nov. 2024. doi: https://doi.org/10.26577/JPCSIT.2023.v1.i1.03.