2002
DOI: 10.1006/jpdc.2001.1781
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Algorithms for Particles–Turbulence Two-Way Interaction Direct Numerical Simulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
1
1

Year Published

2005
2005
2019
2019

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 28 publications
0
4
1
1
Order By: Relevance
“…It is worth mentioning that 4096 2 equals to 256 3 , which means PTF might be faster than PFFT for intermediate resolution of 3D simulation on about 100 processors. This observation is different from the conclusion in [16]. From the speedup plots in lower resolutions (64 2 -1024 2 ) of pseudo-spectral codes on DeepComp 1800, we can draw roughly the same conclusions as those in Section 2.3 and 3.2, which will not be discussed here to make the paper concise.…”
Section: Some Extended Studies Of Ptfcontrasting
confidence: 41%
See 1 more Smart Citation
“…It is worth mentioning that 4096 2 equals to 256 3 , which means PTF might be faster than PFFT for intermediate resolution of 3D simulation on about 100 processors. This observation is different from the conclusion in [16]. From the speedup plots in lower resolutions (64 2 -1024 2 ) of pseudo-spectral codes on DeepComp 1800, we can draw roughly the same conclusions as those in Section 2.3 and 3.2, which will not be discussed here to make the paper concise.…”
Section: Some Extended Studies Of Ptfcontrasting
confidence: 41%
“…see [6,7], and a review paper [8]). The parallel schemes based on spectral methods have also been intensively investigated over the last decade-mainly for three-dimensional (3D) problems [9,10,11,12,13,14,15,16]. The main computation time for spectral methods is concentrated in the part of the Fast Fourier Transform (FFT), around which the 3D parallel schemes are constructed.…”
Section: Introductionmentioning
confidence: 99%
“…In general, there are at least two activities that need to be specified for a master process: sending data and receiving results of computation. To illustrate this approach, the algorithm used in a simulation experiment presented in [8] is employed. Using filmification, there are at least six (6) scenes that comprise the whole computation process using the master/slave scheme given in [8].…”
Section: Specifying Message-passing Type Of Communicationmentioning
confidence: 99%
“…To illustrate this approach, the algorithm used in a simulation experiment presented in [8] is employed. Using filmification, there are at least six (6) scenes that comprise the whole computation process using the master/slave scheme given in [8]. These scenes are: 1) scattering data (Z-slices) to slaves, 2) doing some computations by the slaves, 3) gathering the results from slaves, 4) scattering data (Y-slices) to slaves, 5) doing some computation by the slaves, and 6) gathering data from slaves.…”
Section: Specifying Message-passing Type Of Communicationmentioning
confidence: 99%
“…Na formulação Euler-Langrange aplica-se a segunda lei de Newton a cada partícula individualmente do escoamento, enquanto a fase contínuaé descrita a partir das equações conservativas do meio contínuo. Para fases contínuas,é comum a aplicação de simulação RANS (Reynolds Average Navier-Stokes Simulation) ou DNS/LES (Direct Numeric Simulation/Large-Eddy Simulations), [18], [23], [45], [46], [50], [67], [76], [90].…”
Section: Formulação Euler-langrangeunclassified