Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Binghai Wen

dblp:142/9540 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-0127-3268ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 50% High-performance computing · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
GPUs and heterogeneous computing
GPU computing
0.912025
An Efficient GPU Algorithm for Lattice Boltzmann Method on Sparse Complex Geometries · IEEE Trans. Parallel Distributed Syst. 2025
High-performance computing › scientific computing systems › computational fluid dynamics
lattice boltzmann method
0.912025
An Efficient GPU Algorithm for Lattice Boltzmann Method on Sparse Complex Geometries · IEEE Trans. Parallel Distributed Syst. 2025
Computational science and engineering
computational fluid dynamics
0.312025
An Efficient GPU Algorithm for Lattice Boltzmann Method on Sparse Complex Geometries · IEEE Trans. Parallel Distributed Syst. 2025

Methods — techniques the papers use, named apart from their topics

structure of arrays · 1.7semi-direct addressing · 1.7node classification coding · 1.7
YearPublicationVenuePosition
2025 An Efficient GPU Algorithm for Lattice Boltzmann Method on Sparse Complex Geometries
abstract
Many fluid flow problems, such as the porous media, arterial blood flow and tissue fluid, contain sparse complex geometries. Although the lattice Boltzmann method is good at dealing with the complex boundaries, these sparse complex geometries cause the low computational performance and high memory consumption when the graphics processing unit (GPU) is used to accelerate the numerical computation. These problems would be addressed by compact memory layout, sophisticated memory access and enhanced thread utilization. This paper proposes a GPU-based algorithm to improve the lattice Boltzmann simulations with sparse complex geometries. An access pattern for a single set of distribution functions together with a semi-direct addressing is adopted to reduce memory consumption, while a collected structure of arrays is employed to enhance memory access efficiency. Furthermore, an address index array and a node classification coding scheme are employed to improve the GPU thread utilization ratio and reduce the GPU global memory access, respectively. The accuracy and mesh-independence has been verified by the numerical simulations of Poiseuille flow and porous media flow with face-centered filled spheres. The present algorithm has a significantly lower memory consumption than those based on direct or indirect addressing schemes. It improves the computational performance by several times compared to the other algorithms on the common GPU hardware.
Zhangrong Qin, Xusheng Lu, Long Lv, Zhongxiang Tang, Binghai Wen
IEEE Trans. Parallel Distributed Syst.5