EFFICIENCY OF PARALLEL COMPUTATIONS OF GRAVITATIONAL FORCES BY TREECODE METHOD IN 𝑁-BODY MODELS
Nikolay Kuzmin, Danila Sirotin, Alexander Khoperskov
Source record
Source: Crossref
Published: Dec 27, 2024
DOI: 10.15688/mpcm.jvolsu.2024.4.4
Open original source ↗Source abstract
Modeling of collisionless galactic systems is based on the 𝑁-body model, which requires large computational resources due to the long-range nature of gravitational forces. The most common method for calculating gravity is the TreeCode algorithm, which provides a faster calculation of the force compared to the direct summation of contributions from all particles for 𝑁-body simulation. An analysis of the computational efficiency is performed for models with the number of particles up to 108. We considered several processors with different architectures in order to determine the performance of parallel simulations based on the OpenMP standard. An analysis of the use of extra threads in addition to physical cores shows an increase in simulation performance only when all logical threads are loaded, which doubles the total number of threads. This gives an increase in the efficiency of parallel computing by 20 percent on average.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.