Please use this identifier to cite or link to this item:
Title: Weighted decomposition in high-performance lattice-Boltzmann simulations: Are some lattice sites more equal than others?
Authors: Groen, D
Abou Chacra, D
Nash, RW
Jaros, J
Bernabeu, MO
Coveney, PV
Keywords: High performance computing;Lattice-Boltzmann;Domain decomposition
Issue Date: 2015
Publisher: Springer International Publishing
Citation: International Conference on Exascale Applications and Software, EASC 2014, Stockholm, Sweden, (April 2-3, 2014), Lecture Notes in Computer Science, 8759, pp 28-38, (2015)
Abstract: Obtaining a good load balance is a significant challenge in scaling up lattice-Boltzmann simulations of realistic sparse problems to the exascale. Here we analyze the effect of weighted decomposition on the performance of the HemeLB lattice-Boltzmann simulation environment, when applied to sparse domains. Prior to domain decomposition, we assign wall and in/outlet sites with increased weights which reflect their increased computational cost. We combine our weighted decomposition with a second optimization, which 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 than some of our runs.
ISBN: 978-3-319-15975-1
ISSN: 0302-9743
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf585.45 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.