Gravitational tree-code on graphics processing units: implementation in CUDA
Evghenii Gaburov, Jeroen B\'edorf, Simon Portegies Zwart

TL;DR
This paper introduces a highly efficient gravitational tree-code optimized for NVIDIA CUDA GPUs, enabling rapid force calculations for millions of particles with high performance and user-friendly features.
Contribution
The authors develop a GPU-accelerated gravitational tree-code with a novel division of tasks, achieving significant speedups and making it freely accessible.
Findings
Achieves about 100 GFLOP/s performance.
Computes forces on one million particles in about a second.
Provides a user-friendly, freely available software implementation.
Abstract
We present a new very fast tree-code which runs on massively parallel Graphical Processing Units (GPU) with NVIDIA CUDA architecture. The tree-construction and calculation of multipole moments is carried out on the host CPU, while the force calculation which consists of tree walks and evaluation of interaction list is carried out on the GPU. In this way we achieve a sustained performance of about 100GFLOP/s and data transfer rates of about 50GB/s. It takes about a second to compute forces on a million particles with an opening angle of . The code has a convenient user interface and is freely available for use\footnote{{\tt http://castle.strw.leidenuniv.nl/software/octgrav.html}}.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
