An approach for parallel loading and pre-processing of unstructured meshes stored in spatially scattered fashion

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F19%3A10243796" target="_blank" >RIV/61989100:27740/19:10243796 - isvavai.cz</a>

Výsledek na webu

<a href="https://ieeexplore.ieee.org/document/8820782" target="_blank" >https://ieeexplore.ieee.org/document/8820782</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/IPDPS.2019.00084" target="_blank" >10.1109/IPDPS.2019.00084</a>

Jazyk výsledku

angličtina

Název v původním jazyce

An approach for parallel loading and pre-processing of unstructured meshes stored in spatially scattered fashion

Popis výsledku v původním jazyce

This paper presents a workflow for parallel loading of database files containing sequentially stored unstructured meshes that are not considered to be efficiently read in parallel. In such a file consecutive elements are not spatially located and their respective nodes are at unknown positions in the file. This makes parallel loading challenging since adjacent elements are on different MPI processes, and their respective nodes are on unknown MPI processes. These two facts lead to a high communication overhead and very poor scalability if not addressed properly. In a standard approach, a sequentially stored mesh is sequentially converted to a particular parallel format accepted by a solver. This represents a significant bottleneck. Our proposed algorithm demonstrates that this bottleneck can be overcome, since it is able to (i) efficiently recreate an arbitrary stored sequential mesh in the distributed memory of a supercomputer without gathering the information into a single MPI rank, and (ii) prepare the mesh for massively parallel solvers. (C) 2019 IEEE

Název v anglickém jazyce

An approach for parallel loading and pre-processing of unstructured meshes stored in spatially scattered fashion

Popis výsledku anglicky

This paper presents a workflow for parallel loading of database files containing sequentially stored unstructured meshes that are not considered to be efficiently read in parallel. In such a file consecutive elements are not spatially located and their respective nodes are at unknown positions in the file. This makes parallel loading challenging since adjacent elements are on different MPI processes, and their respective nodes are on unknown MPI processes. These two facts lead to a high communication overhead and very poor scalability if not addressed properly. In a standard approach, a sequentially stored mesh is sequentially converted to a particular parallel format accepted by a solver. This represents a significant bottleneck. Our proposed algorithm demonstrates that this bottleneck can be overcome, since it is able to (i) efficiently recreate an arbitrary stored sequential mesh in the distributed memory of a supercomputer without gathering the information into a single MPI rank, and (ii) prepare the mesh for massively parallel solvers. (C) 2019 IEEE

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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í

2019

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

Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium, IPDPS 2019

ISBN

978-1-72811-246-6

ISSN

—

e-ISSN

1530-2075

Počet stran výsledku

12

Strana od-do

749-760

Název nakladatele

Institute of Electrical and Electronics Engineers Inc.

Místo vydání

Rio de Janeiro

Místo konání akce

Rio de Janeiro

Datum konání akce

20. 5. 2019

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

WRD - Celosvětová akce

Kód UT WoS článku

—