TY - JOUR

T1 - A data-parallel implementation of the DSMC method on the Connection Machine

AU - Wong, B. C.

AU - Long, Lyle Norman

PY - 1992/1/1

Y1 - 1992/1/1

N2 - In some regions, such as low-density hypersonic flow, the Navier-Stokes equations yield poor approximations to the physics of gas dynamics. Aerospace vehicles such as the Space Shuttle, the National Aerospace Plane (NASP), unmanned rockets and satellites must all fly through these regimes. For these flows, the governing equation is the Boltzmann equation of kinetic theory, which is at least an order of magnitude more difficult to solve than the full Navier-Stokes equations and has eluded most attempts to numerically solve it. When one also considers chemical non-equilibrium (dissociation), the problem is almost intractable. The most effective algorithm for solving low-density hypersonic flow is the Direct Simulation Monte Carlo (DSMC) method. This code, however, can require hundreds of hours of supercomputer time per run. This paper describes how the DSMC algorithm can be mapped onto a massively parallel computer (the 65,536 processor Connection Machine). The program is shown to be scalable, with computer time roughly proportional to the number of molecules or number of processors.

AB - In some regions, such as low-density hypersonic flow, the Navier-Stokes equations yield poor approximations to the physics of gas dynamics. Aerospace vehicles such as the Space Shuttle, the National Aerospace Plane (NASP), unmanned rockets and satellites must all fly through these regimes. For these flows, the governing equation is the Boltzmann equation of kinetic theory, which is at least an order of magnitude more difficult to solve than the full Navier-Stokes equations and has eluded most attempts to numerically solve it. When one also considers chemical non-equilibrium (dissociation), the problem is almost intractable. The most effective algorithm for solving low-density hypersonic flow is the Direct Simulation Monte Carlo (DSMC) method. This code, however, can require hundreds of hours of supercomputer time per run. This paper describes how the DSMC algorithm can be mapped onto a massively parallel computer (the 65,536 processor Connection Machine). The program is shown to be scalable, with computer time roughly proportional to the number of molecules or number of processors.

UR - http://www.scopus.com/inward/record.url?scp=3543112430&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3543112430&partnerID=8YFLogxK

U2 - 10.1016/0956-0521(92)90117-2

DO - 10.1016/0956-0521(92)90117-2

M3 - Article

AN - SCOPUS:3543112430

VL - 3

SP - 321

EP - 332

JO - Computing systems in engineering

JF - Computing systems in engineering

SN - 0956-0521

IS - 1-4

ER -