A performance comparison of tree data structures for N-body simulation

Journal of Computational Physics

Volumn 178, Issue 1, 2002, Pages 1-14

  Waltz, J ^a   Page, G L ^a   Milder, S D ^a   Wallin, J ^a   Antunes, A ^a  

^a GEORGE MASON UNIVERSITY   (United States)

Author keywords

Computational astrophysics; N body problem; Tree data structures

Indexed keywords

ASTROPHYSICS; BINARY TREES; HYDRODYNAMICS;

BALANCED BINARY TREE; BARNES HUTS; COMPUTATIONAL ASTROPHYSICS; FAST-MULTIPOLE METHODS; N BODY PROBLEM; N-BODY SIMULATION; NEAREST-NEIGHBOUR; PERFORMANCE; PERFORMANCE COMPARISON; TREE DATA STRUCTURES;

COMPUTATIONAL GEOMETRY;

EID: 0036570979     PISSN: 00219991     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcph.2001.6943     Document Type: Article

References (20)

1. An efficient program for many-body simulation
2. An hierarchical O (N log N) force-calculation algorithm
3. Techniques and tricks for N-body simulation
4. Tree data structures for N-body simulation
5. A fast algorithm for particle simulations
6. The numerical solution of the N-body problem
7. TREESPH-A unification of SPH with the hierarchical tree method
8. Applications of smooth particle hydrodynamics (SPH) to astrophysical problems
9. Performance and accuracy of a GRAPE-3 system for collisionless N-body simulations
10. Skeletons from the treecode closet
11. An implementation of a tree code on a SIMD parallel computer
12. A comparison of two different tree algorithms
13. A comparison between the fast multipole algorithm and the tree-code to evaluate gravitational forces in 3-D
14. A parallel tree code
15. A parallel hashed oct-tree N-body algorithm