Using full hybrid mesh multiplication for simulations on one million MPI tasks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A10229628" target="_blank" >RIV/61989100:27240/15:10229628 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/15:10229628

Výsledek na webu

<a href="http://dx.doi.org/10.4203/ccp.107.34" target="_blank" >http://dx.doi.org/10.4203/ccp.107.34</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4203/ccp.107.34" target="_blank" >10.4203/ccp.107.34</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Using full hybrid mesh multiplication for simulations on one million MPI tasks

Popis výsledku v původním jazyce

Computational Fluid Dynamics (CFD) is one of the fields which can fully utilize the capacity of existing HPC systems. There are many cases either from basic or applied research which are so complex that their numerical simulation requires very fine representation of the computational domain. To tackle some large multi-physics multi-scale problems meshes consisting of hundred billions of cells are necessary. There are several approaches to create such huge meshes. One of them is based on global mesh refinement and is also known as mesh multiplication. Global refinement was already implemented into Code Saturne enhancing its capability in terms of mesh refinement. Meshes with sizes of up to one hundred billion of cells were generated on-the-fly. Since there are many CFD problems where only local area is of interest (either areas close to boundaries, small geometrical entities or in regions with high gradient of solved quantities), local refinement is another approach for mesh generation. In this paper implementation of a parallel local refinement applied to Code Saturne is described. The bottleneck of local adaptive refinement is that it breaks load balancing of the original mesh and requires a lot of global communications. Strategy to repartition the mesh before its refinement is a key issue for optimal resource utilization. To minimize the amount of data transferred among the processor cores it is necessary to do most of the communication during the preprocessing step on the original mesh before refinement. Local mesh refinement strategy was tested and its scalability and performance within Code Saturne were analysed. Results are presented in this paper

Název v anglickém jazyce

Using full hybrid mesh multiplication for simulations on one million MPI tasks

Popis výsledku anglicky

Computational Fluid Dynamics (CFD) is one of the fields which can fully utilize the capacity of existing HPC systems. There are many cases either from basic or applied research which are so complex that their numerical simulation requires very fine representation of the computational domain. To tackle some large multi-physics multi-scale problems meshes consisting of hundred billions of cells are necessary. There are several approaches to create such huge meshes. One of them is based on global mesh refinement and is also known as mesh multiplication. Global refinement was already implemented into Code Saturne enhancing its capability in terms of mesh refinement. Meshes with sizes of up to one hundred billion of cells were generated on-the-fly. Since there are many CFD problems where only local area is of interest (either areas close to boundaries, small geometrical entities or in regions with high gradient of solved quantities), local refinement is another approach for mesh generation. In this paper implementation of a parallel local refinement applied to Code Saturne is described. The bottleneck of local adaptive refinement is that it breaks load balancing of the original mesh and requires a lot of global communications. Strategy to repartition the mesh before its refinement is a key issue for optimal resource utilization. To minimize the amount of data transferred among the processor cores it is necessary to do most of the communication during the preprocessing step on the original mesh before refinement. Local mesh refinement strategy was tested and its scalability and performance within Code Saturne were analysed. Results are presented in this paper

Druh

D - Stať ve sborníku

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í

2015

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 statě ve sborníku

Civil-Comp proceedings. Volume 107

ISBN

978-1-905088-62-1

ISSN

1759-3433

e-ISSN

—

Počet stran výsledku

13

Strana od-do

1-13

Název nakladatele

Civil-Comp Press

Místo vydání

Kippen, Stirlingshire

Místo konání akce

Dubrovník

Datum konání akce

24. 3. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—