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

DOI10.1006/JCPH.2001.6943MaRDI QIDQ1601543zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 2002

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcph.2001.6943

zbMATH Keywords

Barnes-Hut treelong-range gravity

Mathematics Subject Classification ID

Computational methods for problems pertaining to mechanics of particles and systems (70-08) (n)-body problems (70F10) Computational methods for problems pertaining to astronomy and astrophysics (85-08)

Review text

Two tree data structures (the balanced binary one and the Barnes-Hut tree) are compared in parallel with a hereby developed modified binary tree. A general computational tool is developed and used for the controlled comparison. The performance metrics are applied to two types of problems, both for long-range gravity and for short-range physics, and conclusions are drawn. The overall merits of the binary tree approach, especially of the proposed modified one, are documented and its prespective for applications beyond the \(N\)-body simulation is given.

Recommendations

• Tree Data Structures forN-Body Simulation
• Publication:4860168
• A modified tree code: Don't laugh; it runs
• Comparison of two different tree algorithms
• A parallel tree code for large \(N\)-body simulation: Dynamic load balance and data distribution on a CRAY T3D system

Cites work

• A comparison between the fast multipole algorithm and the tree-code to evaluate gravitational forces in 3-D
• A fast algorithm for particle simulations
• Comparison of two different tree algorithms
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3773010 (Why is no real title available?)
• scientific article; zbMATH DE number 46777 (Why is no real title available?)
• scientific article; zbMATH DE number 5245628 (Why is no real title available?)
• Skeletons from the treecode closet
• Tree Data Structures forN-Body Simulation

Cited in

(8)

• Search algorithm, and simulation of elastodynamic crack propagation by modified smoothed particle hydrodynamics (MSPH) method
• A parallel tree code for large \(N\)-body simulation: Dynamic load balance and data distribution on a CRAY T3D system
• High-order predictor--corrector of exponential fitting for the \(N\)-body problems
• A linearly fourth order multirate Runge-Kutta method with error control
• Parametric S-tree method and its generalizations.
• Tree Data Structures forN-Body Simulation
• scientific article; zbMATH DE number 1500640 (Why is no real title available?)
• On improving the algorithm efficiency in the particle-particle force calculations

Describes a project that uses

Uses Software

• TREESPH

This page was built for publication: A performance comparison of tree data structures for \(N\)-body simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601543)