A performance comparison of tree data structures for \(N\)-body simulation
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.
scientific article; zbMATH DE number 1760849