A parallel hashed oct-tree N-body algorithm
- Los Alamos National Lab., NM (United States)
- California Inst. of Tech., Pasadena, CA (United States). Dept. of Physics
We report on an efficient adaptive N-body method which we have recently designed and implemented. The algorithm computers the forces on an arbitrary distribution of bodies in a time which scales as N log N with particle number. The accuracy of the force calculations is analytically bounded, and can be adjusted via a user defined parameter between a few percent relative accuracy, down to machine arithmetic accuracy. Instead of using pointers to indicate the topology of the tree, we identify each possible cell with a key. The mapping of keys into memory locations is achieved via a hash table. This allows us to access data in an efficient manner across multiple processors using a virtual shared memory model. Performance of the parallel program is measured on the 512 processor Intel Touchstone Delta system. We also comment on a number of wide-ranging applications which can benefit from application of this type of algorithm.
- Research Organization:
- Los Alamos National Lab., NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 10157278
- Report Number(s):
- LA-UR-93-1244; CONF-931115-3; ON: DE93012654
- Resource Relation:
- Conference: Supercomputing conference on high performance computing and communications,Portland, OR (United States),15-19 Nov 1993; Other Information: PBD: 29 Mar 1993
- Country of Publication:
- United States
- Language:
- English
Similar Records
2HOT: an improved parallel hashed oct-tree n-body algorithm for cosmological simulation
2HOT: An improved parallel hashed oct-tree N-body algorithm for cosmological simulation