We present a performance comparison of tree data structures for N -body simulation. The tree data structures examined are the balanced binary tree and the Barnes-Hut (BH) tree. Previous work has compared the performance of BH trees with that of nearest-neighbor trees and the fast multipole method, b
Tree Data Structures for N -Body Simulation
โ Scribed by Anderson, Richard J.
- Book ID
- 118177532
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1999
- Tongue
- English
- Weight
- 348 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0097-5397
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We describe a new parallel N-body code for simulations of the formation and evolution of the large-scale structure of the Universe. The code is based on a work-and data-sharing scheme, and is implemented within the Cray Research Corporation's CRAFI "(~) programming environment. Different data distri
N-body codes for performing simulations of the origin and evolution of the largescale structure of the universe have improved significantly over the past decade in terms of both the resolution achieved and the reduction of the CPU time. However, state-of-the-art N-body codes hardly allow one to deal