2011
DOI: 10.1016/j.camwa.2011.04.012
|View full text |Cite
|
Sign up to set email alerts
|

Multi-thread implementations of the lattice Boltzmann method on non-uniform grids for CPUs and GPUs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

3
71
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 105 publications
(74 citation statements)
references
References 19 publications
3
71
0
Order By: Relevance
“…Henceforth, we consider to use a Structure of Array (SoA) approach instead of using AoS. This approach has proven to be a very efficient memory mapping on CUDA-based implementations [5], [3], [16], [15], [20]. Despite that this approach is more amenable to vectorized instructions, we find a large space of memory, as big as the size of the fluid domain, among the different latticevelocities.…”
Section: Lbm Implementatonmentioning
confidence: 99%
See 2 more Smart Citations
“…Henceforth, we consider to use a Structure of Array (SoA) approach instead of using AoS. This approach has proven to be a very efficient memory mapping on CUDA-based implementations [5], [3], [16], [15], [20]. Despite that this approach is more amenable to vectorized instructions, we find a large space of memory, as big as the size of the fluid domain, among the different latticevelocities.…”
Section: Lbm Implementatonmentioning
confidence: 99%
“…Several refinement techniques have been implemented for LBM-based solvers, such as adaptive mesh refinement (AMR) [19], multi-grid [15], and multidomain [14]. Each of these techniques exhibit its own advantages and disadvantages.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The computational multi-domain algorithm is summarized in Appendix C. It is worth noting that the fine grid scales that can not be resolved by the coarse grid are removed using a filtering operator. For more details, as well as alternative algorithms the reader should refer to [45,46,47,48,49]. The overlapping between a fine and a coarse grid is illustrated in Fig.…”
Section: Multi-domain Algorithm and Domain Boundary Conditionsmentioning
confidence: 99%
“…Other implementations [7,9,32,34] have used the traditional implementation sketched in Algorithm 2, which performs the collision operation before the streaming. It is known as the "push" scheme [28] since it loads the distribution function from the current lattice point and then it "pushes" (scatters) the updated values to its neighbours.…”
mentioning
confidence: 99%