EFFICIENCY OF PARALLEL COMPUTATIONS OF GRAVITATIONAL FORCES BY TREECODE METHOD IN 𝑁-BODY MODELS

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.

Authors

Institutions

Publication Details

Journal
Mathematical Physics and Computer Simulation
Published
2024-12-27
DOI
https://doi.org/10.15688/mpcm.jvolsu.2024.4.4
Citations
1
Primary Topic
Galaxies: Formation, Evolution, Phenomena
Type
article
Field-Weighted Citation Impact
0.33

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

EFFICIENCY OF PARALLEL COMPUTATIONS OF GRAVITATIONAL FORCES BY TREECODE METHOD IN 𝑁-BODY MODELS

Nikolay Kuzmin, Danila S. Sirotin, А. В. Хоперсков
1 citations
Mathematical Physics and Computer Simulation
Galaxies: Formation, Evolution, Phenomena
0.33
article

EFFICIENCY OF PARALLEL COMPUTATIONS OF GRAVITATIONAL FORCES BY TREECODE METHOD IN 𝑁-BODY MODELS

Nikolay Kuzmin, Danila S. Sirotin, А. В. Хоперсков
article en
1 citations

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.

Mathematical Physics and Computer SimulationVol. 27(4)
Volgograd State University (RU)
Russian Science Foundation
Openalex Percentile: Top 33%
Galaxies: Formation, Evolution, Phenomena
0.33
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.