Comparison of different propagation steps for lattice Boltzmann methods

From MaRDI portal
Publication:493487

DOI10.1016/J.CAMWA.2012.05.002zbMATH Open1319.76043arXiv1111.0922OpenAlexW2073875590MaRDI QIDQ493487FDOQ493487


Authors: Markus Wittmann, Thomas Zeiser, Georg Hager, Gerhard Wellein Edit this on Wikidata


Publication date: 3 September 2015

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Abstract: Several possibilities exist to implement the propagation step of the lattice Boltzmann method. This paper describes common implementations which are compared according to the number of memory transfer operations they require per lattice node update. A memory bandwidth based performance model is then used to obtain an estimation of the maximal reachable performance on different machines. A subset of the discussed implementations of the propagation step were benchmarked on different Intel and AMD-based compute nodes using the framework of an existing flow solver which is specially adapted to simulate flow in porous media. Finally the estimated performance is compared to the measured one. As expected, the number of memory transfers has a significant impact on performance. Advanced approaches for the propagation step like "AA pattern" or "Esoteric Twist" require more implementation effort but sustain significantly better performance than non-naive straight forward implementations.


Full work available at URL: https://arxiv.org/abs/1111.0922




Recommendations





Cited In (18)





This page was built for publication: Comparison of different propagation steps for lattice Boltzmann methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493487)