Using discrete mathematics to optimize parallelism in boundary element method

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F17%3A10237155" target="_blank" >RIV/61989100:27240/17:10237155 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/17:10237155

Výsledek na webu

<a href="http://www.ctresources.info/ccp/paper.html?id=9224" target="_blank" >http://www.ctresources.info/ccp/paper.html?id=9224</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Using discrete mathematics to optimize parallelism in boundary element method

Popis výsledku v původním jazyce

In this work we present an approach for distribution of system matrices occurring in the fast boundary element method (BEM) among computational nodes in order to accelerate their assembly. An underlying mesh is decomposed into a given number of submeshes, pairs of which represent blocks in a system matrix. The aim is to distribute the submeshes among computational nodes in a way which minimizes the amount of mesh parts owned by a single process and which inherently defines the distribution of the system matrix. Additionally, each process owns exactly one diagonal block since their assembly is typically the most time consuming in the fast BEM. The distribution of submeshes is based on a cyclic decomposition of complete graphs into dense subgraphs. We briefly present the method, a boundary element environment it is implemented in and provide results of numerical experiments. © Civil-Comp Press, 2017.

Název v anglickém jazyce

Using discrete mathematics to optimize parallelism in boundary element method

Popis výsledku anglicky

In this work we present an approach for distribution of system matrices occurring in the fast boundary element method (BEM) among computational nodes in order to accelerate their assembly. An underlying mesh is decomposed into a given number of submeshes, pairs of which represent blocks in a system matrix. The aim is to distribute the submeshes among computational nodes in a way which minimizes the amount of mesh parts owned by a single process and which inherently defines the distribution of the system matrix. Additionally, each process owns exactly one diagonal block since their assembly is typically the most time consuming in the fast BEM. The distribution of submeshes is based on a cyclic decomposition of complete graphs into dense subgraphs. We briefly present the method, a boundary element environment it is implemented in and provide results of numerical experiments. © Civil-Comp Press, 2017.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

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í

2017

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

Civil-Comp Proceedings

ISSN

1759-3433

e-ISSN

—

Svazek periodika

111

Číslo periodika v rámci svazku

2017

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

10

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85020427603