Weighted decomposition in high-performance lattice-Boltzmann simulations: are some lattice sites more equal than others?

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F15%3APU136004" target="_blank" >RIV/00216305:26230/15:PU136004 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007/978-3-319-15976-8_2" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-319-15976-8_2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-15976-8_2" target="_blank" >10.1007/978-3-319-15976-8_2</a>

Result language
angličtina
Original language name
Weighted decomposition in high-performance lattice-Boltzmann simulations: are some lattice sites more equal than others?
Original language description
Obtaining a good load balance is a significant challenge in scaling up lattice-Boltzmann simulations of realistic sparse problems to the exascale. Here we analyse the effect of two optimization techniques on the performance of the HemeLB lattice-Boltzmann simulation environment, when applied to sparse domains. Both techniques are applied prior to partitioning our domain using a third party library. One technique is to provide wall and in/outlet sites with increased weights, and the other is to sort the lattice sites according to a space filling curve. We tested these strategies on a sparse bifurcation and very sparse aneurysm geometry, and find that using weights reduces calculation load imbalance by up to 85%, although the overall communication overhead is higher is some of our runs.
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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

Similar results(10)