Performance evaluation of a Parallel Sparse Lattice Boltzmann Solver

QC 20120214
We develop a performance prediction model for a parallelized sparse lattice Boltzmann solver and present performance results for simulations of flow in a variety of complex geometries. A special focus is on partitioning and memory/load balancing strategy for geometries with a high solid fraction and/or complex topology such as porous media, fissured rocks and geometries from medical applications. The topology of the lattice nodes representing the fluid fraction of the computational domain is mapped on a graph. Graph decomposition is performed with both multilevel recursive-bisection and multilevel k-way schemes based on modified Kernighan–Lin and Fiduccia–Mattheyses partitioning algorithms. Performance results and optimization strategies are presented for a variety of platforms, showing a parallel efficiency of almost 80% for the largest problem size. A good agreement between the performance model and experimental results is demonstrated.

Ingår i:Journal of Computational Physics: Elsevier BV227:10, s. 4895-49110021-99911090-2716

Av författaren/redakt...: Axner, Lilit; Bernsdorf, Joerg ...; Zeiser, Thomas; Lammers, Peter; Linxweiler, Jan; Hoekstra, Alfons ...

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.