Geodesic
Modified method large sparse unstructured matrices processing on reconfigurable computing systems
Numerical methods and programming, Tome 25 (2024) no. 2, pp. 142-154.

Voir la notice de l'article provenant de la source Math-Net.Ru

When processing high-dimensional matrices with an irregular structure, the realperformance of cluster multiprocessor computing systems (MCS) is low and even with the use of special processing methods does not exceed 30%. To effectively process large matrices with an irregular structure, it is possible to use reconfigurable computing systems (RCS), for which the authors proposed a method for processing large sparse unstructured (LSU) matrices, due to which real performance was achieved close to 50% of the peak. The article describes a modification of the developed method for processing LSU matrices, which is characterized by parallel processing of non-zero row elements and allows doubling the speed of the computing structure with a slight increase in the occupied hardware resource. The modified method of processing LSU matrices on an RCS provides real performance close to 90% of the peak, which significantly exceeds the known results of solving similar problems for cluster MCS. Comparison of the results of solving the problem of ranking web pages using the PageRank algorithm obtained on the “Arcturus” RCS and the Fugaku supercomputer, as well as the results of solving the SLAE using the Jacobi method on the “Arcturus” RCS and the graphics accelerator NVidia Tesla K40 confirms the theoretical conclusions.
Keywords: reconfigurable computing systems, high-performance computing systems, large unstructured matrix, intensity balance dataflow, parallelization of calculations, parallelization over non-zero elements.
Mots-clés : sparse matrix, sparse matrix format, discrete-event transformation 
@article{VMP_2024_25_2_a8,
     author = {I. I. Levin and A. V. Podoprigora},
     title = {Modified method large sparse unstructured matrices processing on reconfigurable computing systems},
     journal = {Numerical methods and programming},
     pages = {142--154},
     publisher = {mathdoc},
     volume = {25},
     number = {2},
     year = {2024},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2024_25_2_a8/}
}
TY  - JOUR
AU  - I. I. Levin
AU  - A. V. Podoprigora
TI  - Modified method large sparse unstructured matrices processing on reconfigurable computing systems
JO  - Numerical methods and programming
PY  - 2024
SP  - 142
EP  - 154
VL  - 25
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMP_2024_25_2_a8/
LA  - ru
ID  - VMP_2024_25_2_a8
ER  - 
%0 Journal Article
%A I. I. Levin
%A A. V. Podoprigora
%T Modified method large sparse unstructured matrices processing on reconfigurable computing systems
%J Numerical methods and programming
%D 2024
%P 142-154
%V 25
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMP_2024_25_2_a8/
%G ru
%F VMP_2024_25_2_a8
I. I. Levin; A. V. Podoprigora. Modified method large sparse unstructured matrices processing on reconfigurable computing systems. Numerical methods and programming, Tome 25 (2024) no. 2, pp. 142-154. http://geodesic.mathdoc.fr/item/VMP_2024_25_2_a8/