Comparison of implementations of the lattice-Boltzmann method

@article{Mattila2008ComparisonOI,
  title={Comparison of implementations of the lattice-Boltzmann method},
  author={Keijo Mattila and Jari Hyv{\"a}luoma and Jussi Timonen and Tuomo Rossi},
  journal={Computers & Mathematics with Applications},
  year={2008},
  volume={55},
  pages={1514-1524}
}
Simplicity of coding is usually an appealing feature of the lattice-Boltzmann method (LBM). Conventional implementations of LBM are often based on the two-lattice or the two-step algorithm, which however suffer from high memory consumption and poor computational performance, respectively. The aim of this work was to identify implementations of LBM that would achieve high computational performance with low memory consumption. Effects of memory addressing schemes were investigated in particular… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

GPU Data Access on Complex Geometries for D3Q19 Lattice Boltzmann Method

  • 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
  • 2018
VIEW 12 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Lattice Boltzmann Method and Its Applications in Soft Matter

VIEW 13 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Incompressible SPH (ISPH) on the GPU

VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

Comput

C. Pan, J. F. Prins, C. T. Miller
  • Phys. Commun. 158
  • 2004
VIEW 2 EXCERPTS

Future Gener

R. Argentini, A. F. Bakker, C. P. Lowe
  • Comput. Syst. 20
  • 2004
VIEW 2 EXCERPTS

Phys

Z. Guo, T. S. Zhao, Y. Shi
  • Rev. E 70
  • 2004

Parallel Process

T. Pohl, M. Kowarschik, J. Wilke, K. Iglberger, U. Rüde
  • Lett. 13
  • 2003
VIEW 2 EXCERPTS

Achieving high performance in a LBM code using OpenMP

F. Massaioli, G. Amati
  • in: The Fourth European Workshop on OpenMP, Roma
  • 2002
VIEW 1 EXCERPT

Mater

N. S. Martys, J. G. Hagedorn
  • Struct. 35
  • 2002
VIEW 2 EXCERPTS

Similar Papers