Publication Details
Weighted decomposition in high-performance lattice-Boltzmann simulations: are some lattice sites more equal than others?
high performance computing; lattice-Boltzmann; domain decomposition
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.
@inproceedings{BUT163345,
author="GROEN, D. and CHACRA, D. and NASH, R. and JAROŠ, J. and BERNABEU, M. and COVENEY, P.",
title="Weighted decomposition in high-performance lattice-Boltzmann simulations: are some lattice sites more equal than others?",
booktitle="Solving Software Challengesfor Exascale",
year="2015",
series="Lecture Notes in Computer Science",
volume="8759",
pages="28--38",
publisher="Springer Verlag",
address="Stockholm",
doi="10.1007/978-3-319-15976-8\{_}2",
isbn="978-3-319-15975-1",
url="https://link.springer.com/chapter/10.1007/978-3-319-15976-8_2"
}