Acceleration of a parallel BDDC solver by using graphics processing units on subdomains

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F23%3A00575122" target="_blank" >RIV/67985840:_____/23:00575122 - isvavai.cz</a>

Alternative codes found

RIV/68407700:21240/23:00364849 RIV/68407700:21340/23:00364849

Result on the web

<a href="https://doi.org/10.1177/10943420221136873" target="_blank" >https://doi.org/10.1177/10943420221136873</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1177/10943420221136873" target="_blank" >10.1177/10943420221136873</a>

Result language

angličtina

Original language name

Acceleration of a parallel BDDC solver by using graphics processing units on subdomains

Original language description

An approach to accelerating a parallel domain decomposition (DD) solver by graphics processing units (GPUs) is investigated. The solver is based on the Balancing Domain Decomposition Method by Constraints (BDDC), which is a nonoverlapping DD technique. Two kinds of local matrices are required by BDDC. First, dense matrices corresponding to local Schur complements of interior unknowns are constructed by the sparse direct solver. These are further used as part of the local saddle-point problems within BDDC. In the next step, the local matrices are copied to GPUs. Repeated multiplications of local vectors with the dense matrix of the Schur complement are performed for each subdomain. In addition, factorizations and backsubstitutions with the dense saddle-point subdomain matrices are also performed on GPUs. Detailed times of main components of the algorithm are measured on a benchmark Poisson problem. The method is also applied to an unsteady problem of incompressible flow, where the Krylov subspace iterations are performed repeatedly in each time step. The results demonstrate the potential of the approach to speed up realistic simulations up to 5 times with a preference towards large subdomains.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10102 - Applied mathematics

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2023

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

International Journal of High Performance Computing Applications

ISSN

1094-3420

e-ISSN

1741-2846

Volume of the periodical

37

Issue of the periodical within the volume

2

Country of publishing house

GB - UNITED KINGDOM

Number of pages

14

Pages from-to

151-164

UT code for WoS article

000879122700001

EID of the result in the Scopus database

2-s2.0-85141596886