Implementation of the efficient communication layer for the highly parallel total FETI and hybrid total FETI solvers
The result's identifiers
Result code in 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>
Alternative codes found
RIV/61989100:27240/16:86099003 RIV/61989100:27230/16:86099003
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Implementation of the efficient communication layer for the highly parallel total FETI and hybrid total FETI solvers
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Parallel computing
ISSN
0167-8191
e-ISSN
—
Volume of the periodical
57
Issue of the periodical within the volume
SEP 2016
Country of publishing house
US - UNITED STATES
Number of pages
13
Pages from-to
154-166
UT code for WoS article
000383307100012
EID of the result in the Scopus database
2-s2.0-84973649739