Implementation of the efficient communication layer for the highly parallel total FETI and hybrid total FETI solvers

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F16%3A86099003" target="_blank" >RIV/61989100:27740/16:86099003 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27240/16:86099003 RIV/61989100:27230/16:86099003

Výsledek na webu

<a href="http://www.sciencedirect.com/science/article/pii/S0167819116300333" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0167819116300333</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.parco.2016.05.002" target="_blank" >10.1016/j.parco.2016.05.002</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Implementation of the efficient communication layer for the highly parallel total FETI and hybrid total FETI solvers

Popis výsledku v původním jazyce

This paper describes the implementation, performance, and scalability of our communication layer developed for Total FETI (TFETI) and Hybrid Total FETI (HTFETI) solvers. HTFETI is based on our variant of the Finite Element Tearing and Interconnecting (FETI) type domain decomposition method. In this approach a small number of neighboring subdomains is aggregated into clusters, which results in a smaller coarse problem. To solve the original problem TFETI method is applied twice: to the clusters and then to the subdomains in each cluster. The current implementation of the solver is focused on the performance optimization of the main CG iteration loop, including: implementation of communication hiding and avoiding techniques for global communications; optimization of the nearest neighbor communication - multiplication with a global gluing matrix; and optimization of the parallel CG algorithm to iterate over local Lagrange multipliers only. The performance is demonstrated on a linear elasticity 3D cube and real world benchmarks.

Název v anglickém jazyce

Implementation of the efficient communication layer for the highly parallel total FETI and hybrid total FETI solvers

Popis výsledku anglicky

This paper describes the implementation, performance, and scalability of our communication layer developed for Total FETI (TFETI) and Hybrid Total FETI (HTFETI) solvers. HTFETI is based on our variant of the Finite Element Tearing and Interconnecting (FETI) type domain decomposition method. In this approach a small number of neighboring subdomains is aggregated into clusters, which results in a smaller coarse problem. To solve the original problem TFETI method is applied twice: to the clusters and then to the subdomains in each cluster. The current implementation of the solver is focused on the performance optimization of the main CG iteration loop, including: implementation of communication hiding and avoiding techniques for global communications; optimization of the nearest neighbor communication - multiplication with a global gluing matrix; and optimization of the parallel CG algorithm to iterate over local Lagrange multipliers only. The performance is demonstrated on a linear elasticity 3D cube and real world benchmarks.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2016

Kód důvěrnosti údajů

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

Název periodika

Parallel computing

ISSN

0167-8191

e-ISSN

—

Svazek periodika

57

Číslo periodika v rámci svazku

SEP 2016

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

13

Strana od-do

154-166

Kód UT WoS článku

000383307100012

EID výsledku v databázi Scopus

2-s2.0-84973649739