Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2011-11-03
Computer Science
Distributed, Parallel, and Cluster Computing
17 pages, 11 figures, 8 tables, preprint submitted to Computers & Mathematics with Applications
Scientific paper
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.
Hager Georg
Wellein Gerhard
Wittmann Markus
Zeiser Thomas
No associations
LandOfFree
Comparison of different Propagation Steps for the Lattice Boltzmann Method does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Comparison of different Propagation Steps for the Lattice Boltzmann Method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comparison of different Propagation Steps for the Lattice Boltzmann Method will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-703304