Massively parallel hybrid total FETI (HTFETI) solver

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F16%3A86099010" target="_blank" >RIV/61989100:27230/16:86099010 - isvavai.cz</a>

Alternative codes found

RIV/61989100:27240/16:86099010 RIV/61989100:27740/16:86099010

Result on the web

<a href="http://espreso.it4i.cz/wp-content/uploads/2016/05/RIHA_PASC2016.pdf" target="_blank" >http://espreso.it4i.cz/wp-content/uploads/2016/05/RIHA_PASC2016.pdf</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/2929908.2929909" target="_blank" >10.1145/2929908.2929909</a>

Result language

angličtina

Original language name

Massively parallel hybrid total FETI (HTFETI) solver

Original language description

PASC 2016 - Proceedings of the Platform for Advanced Scientific Computing Conference 8 June 2016, Article number 2929909 3rd Conference on Platform for Advanced Scientific Computing, PASC 2016; Lausanne; Switzerland; 8 June 2016 through 10 June 2016; Code 122253 Massively parallel hybrid total FETI (HTFETI) solver (Conference Paper) Ríha, L. , Brzobohatý, T. , Markopoulos, A. , Meca, O. , Kozubek, T. IT4Innovations National, Supercomputing Center, Ostrava, Czech Republic View references (11) Abstract This paper describes the Hybrid Total FETI (HTFETI) method and its parallel implementation in the ESPRESO library. HTFETI is a variant of the FETI type domain decomposition method in which a small number of neighboring subdomains is aggregated into clusters. This can be also viewed as a multilevel decomposition approach which results into a smaller coarse problem - The main scalability bottleneck of the FETI and FETI-DP methods. The efficiency of our implementation which employs hybrid parallelization in the form of MPI and Cilk++ is evaluated using both weak and strong scalability tests. The weak scalability of the solver is shown on the 3 dimensional linear elasticity problem of a size up to 30 billion of Degrees Of Freedom (DOF) executed on 4096 compute nodes. The strong scalability is evaluated on the problem of size 2.6 billion DOF scaled from 1000 to 4913 compute nodes. The results show the super-linear scaling of the single iteration time and linear scalability of the solver runtime. The latter combines both numerical and parallel scalability and shows overall HTFETI solver performance. The large scale tests use our own parallel synthetics benchmark generator that is also described in the paper. The last set of results shows that HTFETI is very efficient for problems of size up 1.7 billion DOF and provide better time to solution when compared to TFETI method.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

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)

Publication year

2016

Confidentiality

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

Article name in the collection

PASC 2016 - Proceedings of the Platform for Advanced Scientific Computing Conference

ISBN

978-1-4503-4126-4

ISSN

—

e-ISSN

—

Number of pages

11

Pages from-to

"nestrankovano"

Publisher name

Association for Computing Machinery

Place of publication

New York

Event location

Lausanne

Event date

Jun 8, 2016

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—