RUS  ENG
Full version
JOURNALS // Vestnik Yuzhno-Ural'skogo Gosudarstvennogo Universiteta. Seriya "Vychislitelnaya Matematika i Informatika" // Archive

Vestn. YuUrGU. Ser. Vych. Matem. Inform., 2020 Volume 9, Issue 1, Pages 69–82 (Mi vyurv232)

This article is cited in 1 paper

Application of analytical modeling of matrix-vector multiplication on multicore processors

E. N. Akimovaab, R. A. Gareeva

a Ural Federal University (Mira 19, Yekaterinburg, 620002 Russia)
b N.N. Krasovskii Institute of Mathematic sand Mechanics, UrB RAS (S. Kovalevskaya 16, Yekaterinburg, 620990 Russia)

Abstract: Many areas of study and their applications such as machine learning, data mining, quantum chemistry, mathematical physics, and high-performance computing require effective implementation of matrix-vector multiplication. In this work, we present an overview of the algorithm for automatic optimization of matrix-vector multiplication. The algorithm models computations on the hypothetical multicore processor, which is introduced by the authors, and applies polyhedral modeling. In comparison with methods, which rely on manual tuning and auto-tuning, the algorithm can be utilized when the execution time is a critical factor and the target platform is not accessible. We apply the approach to optimize an implementation of the solution of the inverse gravimetry problem of finding an interface between the layers, which uses the iterative Levenberg-Marquardt method. The performance of the obtained implementation is compared with the performances produced by implementations, which are based on MKL, BLIS, and OpenBLAS. Results of the experimental evaluation show that the considered approach is comparable with the approaches, which are created on target architectures using manual tuning.

Keywords: compilers, linear algebra, matrix-vector operations, analytical modeling, inverse gravimetry problem.

UDC: 004.021, 519.685

Received: 31.01.2020

DOI: 10.14529/cmse200105



© Steklov Math. Inst. of RAS, 2024