2009/09/02 by N. Nakasato, Nakasato, N.
Physics and Astronomy · #Astrophysics of Galaxies (astro-ph.GA) #FOS: Physical sciences #Instrumentation and Methods for Astrophysics (astro-ph.IM) #astro-ph.GA #astro-ph.IM
paper · pdf · doi:10.48550/arxiv.0909.0541
Poster paper to be appeared in SC09
arxiv created 2009/09/02 · arxiv updated 2009/12/01
The kd-tree is a fundamental tool in computer science. Among others, an application of the kd-tree search (oct-tree method) to fast evaluation of particle interactions and neighbor search is highly important since computational complexity of these problems are reduced from O(N2) with a brute force method to O(N log N) with the tree method where N is a number of particles. In this paper, we present a parallel implementation of the tree method running on a graphic processor unit (GPU). We successfully run a simulation of structure formation in the universe very efficiently. On our system, which costs roughly 900, the run with N ~ 2.87x106 particles took 5.79 hours and executed 1.2x1013 force evaluations in total. We obtained the sustained computing speed of 21.8 Gflops and the cost per Gflops of 41.6/Gflops that is two and half times better than the previous record in 2006.