Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > An Efficient Swap Algorithm fo...

An Efficient Swap Algorithm for the Lattice Boltzmann Method

Keijo Mattila, Jari Hyväluoma, Tuomo Rossi, Mats Aspnäs, Jan Westerholm, An Efficient Swap Algorithm for the Lattice Boltzmann Method. Computer Physics Communications 176(3), 200–210, 2007.

Abstract:

During the last decade, the lattice-Boltzmann method (LBM) as a valuable tool in computational
fluid dynamics has been increasingly acknowledged. The widespread application of LBM is partly
due to the simplicity of its coding. The most well-known algorithms for the implementation
of the standard lattice-Boltzmann equation (LBE) are the two-lattice and two-step algorithms.
However, implementations of the two-lattice or the two-step algorithm suffer from high memory
consumption or poor computational performance, respectively. Ultimately, the computing
resources available decide which of the two disadvantages is more critical. Here we introduce a
new algorithm, called the swap algorithm, for the implementation of LBE. Simulation results
demonstrate that implementations based on the swap algorithm can achieve high computational
performance and have very low memory consumption. Furthermore, we show how the
performance of its implementations can be further improved by code optimization.

BibTeX entry:

@ARTICLE{jMaHyRoAsWe07a,
  title = {An Efficient Swap Algorithm for the Lattice Boltzmann Method},
  author = {Mattila, Keijo and Hyväluoma, Jari and Rossi, Tuomo and Aspnäs, Mats and Westerholm, Jan},
  journal = {Computer Physics Communications},
  volume = {176},
  number = {3},
  publisher = {Elsevier},
  pages = {200–210},
  year = {2007},
  keywords = {Lattice Boltzmann; Algorithm; Implementation; Code optimization},
}

Belongs to TUCS Research Unit(s): High Performance Computing and Communication

Publication Forum rating of this publication: level 1

Edit publication