GPU-Enabled Particle-Particle Particle-Tree Scheme for Simulating Dense Stellar Cluster System
Masaki Iwasawa, Simon Portegies Zwart, Junichiro Makino

TL;DR
This paper presents a GPU-accelerated Particle-Particle Particle-Tree scheme for simulating dense stellar clusters, combining direct summation and Barnes-Hut tree methods for efficient and accurate force calculations.
Contribution
It introduces a novel GPU-enabled implementation of the P3T scheme, integrating direct summation with tree-based methods for improved performance in dense star cluster simulations.
Findings
High performance and accuracy in large particle simulations
Effective handling of small core sizes in star clusters
GPU acceleration significantly speeds up computations
Abstract
We describe the implementation and performance of the (Particle-Particle Particle-Tree) scheme for simulating dense stellar systems. In , the force experienced by a particle is split into short-range and long-range contributions. Short-range forces are evaluated by direct summation and integrated with the fourth order Hermite predictor-corrector method with the block timesteps. For long-range forces, we use a combination of the Barnes-Hut tree code and the leapfrog integrator. The tree part of our simulation environment is accelerated using graphical processing units (GPU), whereas the direct summation is carried out on the host CPU. Our code gives excellent performance and accuracy for star cluster simulations with a large number of particles even when the core size of the star cluster is small.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScientific Research and Discoveries · Stellar, planetary, and galactic studies · Astro and Planetary Science
