## A Portable Parallel Particle Program (1995)

Venue: | Computer Physics Communications |

Citations: | 53 - 7 self |

### BibTeX

@ARTICLE{Warren95aportable,

author = {Michael S. Warren and John K. Salmon},

title = {A Portable Parallel Particle Program},

journal = {Computer Physics Communications},

year = {1995},

volume = {87},

pages = {266--290}

}

### Years of Citing Articles

### OpenURL

### Abstract

We describe our implementation of the parallel hashed oct-tree (HOT) code, and in particular its application to neighbor finding in a smoothed particle hydrodynamics (SPH) code. We also review the error bounds on the multipole approximations involved in treecodes, and extend them to include general cell-cell interactions. Performance of the program on a variety of problems (including gravity, SPH, vortex method and panel method) is measured on several parallel and sequential machines. 1 Introduction There are two strategies that can be applied in the quest for more knowledge from bigger and better particle simulations. One can use the brute force approach; simple algorithms on bigger and faster machines (and bigger and faster now means massively parallel). To compute the gravitational force and potential for a single interaction takes 28 floating point operations (here we count a division as 4 floating point operations and a square root as 4 floating point operations). A typical grav...