Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 1995 | Updated
Journal Article Open

A portable parallel particle program

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.

Additional Information

© 1995 Elsevier. Received 25 May 1994. Special thanks to Melvyn Davies for much help with the SPH code, and G. S. Winckelmans for the implementation of the vortex and panel method modules. We would like to thank David Edelsohn for providing the benchmark results on the SP-1, and IBM Watson Research center for providing time on that machine. The authors wish to acknowledge the Advanced Computing Laboratory of Los Alamos National Laboratory, Los Alamos, NM 87545; this work was performed in part on computing resources located at that facility. Time on the CM-5E was provided by the Naval Research Laboratory. This research was performed in part using the Intel Touchstone Delta System and the Intel Paragon operated by Caltech on behalf of the Concurrent Supercomputing Consortium. This research was supported in part by a grant from NASA under the HPCC program.

Attached Files

Updated - 53ea21760cf2fb1b9b67646f.pdf

Files

53ea21760cf2fb1b9b67646f.pdf
Files (1.8 MB)
Name Size Download all
md5:24cab83ed9cab30ed4b772f335ee9eb6
1.8 MB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 25, 2023