2015/09/30 by Gunther Lukat, Robi Banerjee · 1 citation
Earth and Planetary Sciences · Engineering · Physics and Astronomy · #Algorithm #CUDA #Code (set theory) #Computational science #Computer graphics (images) #Computer science #Factor (programming language) #Geophysics and Gravity Measurements #Octree #Parallel computing #Physics #Polygon mesh #Programming language #Scientific Research and Discoveries #Spacecraft and Cryogenic Technologies #Speedup #Tree (set theory) #astro-ph.GA #astro-ph.IM #physics.comp-ph
paper · pdf · doi:10.1016/j.newast.2015.10.007
published as New Astron. 45 (2016) 14-28 · For further information see: http://www.hs.uni-hamburg.de/gpubh
openalex publication_date 2015/10/26 · arxiv created 2015/11/26 · arxiv updated 2015/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We present a GPU accelerated CUDA-C implementation of the Barnes Hut (BH) tree code for calculating the gravitational potential on octree adaptive meshes. The tree code algorithm is implemented within the FLASH4 adaptive mesh refinement (AMR) code framework and therefore fully MPI parallel. We describe the algorithm and present test results that demonstrate its accuracy and performance in comparison to the algorithms available in the current FLASH4 version. We use a MacLaurin spheroid to test the accuracy of our new implementation and use spherical, collapsing cloud cores with effective AMR to carry out performance tests also in comparison with previous gravity solvers. Depending on the setup and the GPU/CPU ratio, we find a speedup for the gravity unit of at least a factor of 3 and up to 60 in comparison to the gravity solvers implemented in the FLASH4 code. We find an overall speedup factor for full simulations of at least factor 1.6 up to a factor of 10