M. Sheida - Sharif University of Technology, Tehran, Iran
M. Taeibi-Rahni - University of Tehran, Tehran, Iran
V. Esfahanian - University of Tehran, Tehran, Iran

Several efforts have been performed to improve LBM defects related to its computational performance. In this work, a new algorithm has been introduced to reduce memory consumption. In the past, most LBM developers have not paid enough attention to retain LBM simplicity in their modified version, while it has been one of the main concerns in developing of the present algorithm. Note, there is also a deficiency in our new algorithm. Besides the memory reduction, because of high memory call back from the main memory, some computational efficiency reduction occurs. To overcome this difficulty, an optimization approach has been introduced, which has recovered this efficiency to the original two-steps two-lattice LBM. This is accomplished by a trade-off between memory reduction and computational performance. To keep a suitable computational efficiency, memory reduction has reached to about ۳۳% in D۲Q۹ and ۴۲% in D۳Q۱۹. In addition, this approach has been implemented on graphical processing unit (GPU) as well. In regard to onboard memory limitation in GPU, the advantage of this new algorithm is enhanced even more (۳۹% in D۲Q۹ and ۴۵% in D۳Q۱۹). Note, because of higher memory bandwidth in GPU, computational performance of our new algorithm using GPU is better than CPU.

Memory reduction, Optimization, Computational performance, Lattice boltzmann method (LBM)