
On the Efficiency of Algorithms with Multi-level Parallelism
Author(s) -
Олександр Володимирович Попов,
Oleksiy Chystiakov
Publication year - 2021
Publication title -
fìziko-matematične modelûvannâ ta ìnformacìjnì tehnologìï/fìzìko-matematične modelûvannâ ta ìnformacìjnì tehnologìï
Language(s) - English
Resource type - Journals
eISSN - 2617-5258
pISSN - 1816-1545
DOI - 10.15407/fmmit2021.33.133
Subject(s) - mimd , computer science , parallel computing , parallel algorithm , parallelism (grammar) , acceleration , eigenvalues and eigenvectors , algorithm , theoretical computer science , physics , classical mechanics , quantum mechanics
The paper investigates the efficiency of algorithms for solving computational mathematics problems that use a multilevel model of parallel computing on heterogeneous computer systems. A methodology for estimating the acceleration of algorithms for computers using a multilevel model of parallel computing is proposed. As an example, the parallel algorithm of the iteration method on a subspace for solving the generalized algebraic problem of eigenvalues of symmetric positive definite matrices of sparse structure is considered. For the presented algorithms, estimates of acceleration coefficients and efficiency were obtained on computers of hybrid architecture using graphics accelerators, on multi-core computers with shared memory and multi-node computers of MIMD-architecture.