Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · comp-gas/9310002

Particle-Mesh Methods on the Connection Machine

Robert Ferrell·Edmund Bertschinger
View original source ↗Read source document ↗Export metadata ↓

Abstract

We describe an efficient Particle-Mesh algorithm for the Connection Machine CM-5. Our particular method parallelizes well and the computation time per time step decreases as the particles become more clustered. We achieve floating-point computation rates of 4--5 MFlops/sec/processing node and total operations (the sum of floating-point and integer arithmetic plus communications) of 5--10 MOps/sec/processing node. The rates scale almost linearly from 32 to 256 processors. Although some of what we discuss is specific to the CM-5, many aspects (e.g., the computation of the force on a mesh) are generic to all implementations, and other aspects (e.g., the algorithm for assignment of the density to the mesh) are useful on any parallel computer.

Explore related subjects

comp-gasastro-phnlin.CG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert Ferrell, Edmund Bertschinger. 1993-11-02. Particle-Mesh Methods on the Connection Machine. https://doi.org/10.1142/s0129183194001069

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv1999

Exact results for deterministic cellular automata traffic models

We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to a well known lattice path counting problem. Assuming infinite lattice size and random initial configuration, the flow can be expressed in terms of generalized hypergeometric function. We show that the steady state limit agrees with previously published results.

comp-gas↗
arXiv1999

A new discrete velocity method for Navier-Stokes equations

The relation between Latttice Boltzmann Method, which has recently become popular, and the Kinetic Schemes, which are routinely used in Computational Fluid Dynamics, is explored. A new discrete velocity model for the numerical solution of the Navier-Stokes equations for incompressible fluid flow is presented by combining both the approaches. The new scheme can be interpreted as a pseudo-compressibility method and, for a particular choice of parameters, this interpretation carries over to the Lattice Boltzmann Method.

comp-gas↗
arXiv1999

Construction of Molecular Dynamics Like Cellular Automata Models for Simulation of Compressible Fluid Dynamic Systems

This study aims at finding a method for constructing molecular dynamics like models using the formalism of cellular automata for fast simulation of fluid dynamic systems (including compressible phenomena). In as much as the results indicate, the attempt is successful. A systematic method for constructing cellular automata models of fluid dynamic systems is discovered and proposed following a review of the existing developments. The considerations required for constructing such models for fluid dynamic systems consisting of particles with arbitrary interaction potentials and existing over arbitrary spatial lattices are outlined. The method is illustrated by constructing a model for simulation of systems of particles moving with unit speed along the links of an underlying square spatial lattice. Using this model, two two-dimensional systems are simulated and studied for a number of model and system parameters. For almost all the model and system parameters, the results are found to be in complete agreement with the available theoretical predictions. For some model parameters, results show (expected) departure from theoretical predictions which is explained.

comp-gas↗