Title :
Barnes-hut treecode on GPU
Author :
Jiang, Hu ; Deng, Qianni
Author_Institution :
Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China
Abstract :
General-purpose computation on graphics processing units (GPGPU) has become a popular field of study. Due to its high computing capacity and relatively low price, GPU has been an ideal processing unit for many scientific applications, among which is N-body simulation. According to the published papers, a simple O(N^2) algorithm of N-body simulation has achieved some enhancements, but tree-algorithm doesn´t work well on GPU. This paper proposes a new implementation of tree-algorithm on GPU using CUDA, which has obtained more than 100X speedup when computing forces between bodies. This paper also rises up a new method to build tree in this algorithm, making the performance even better.
Keywords :
computational complexity; computer architecture; computer graphic equipment; coprocessors; trees (mathematics); CUDA; GPU; N-body simulation; graphics processing unit; tree algorithm; Force; Graphics processing unit; Memory management; Parallel processing; GPGPU; N-body simulation; tree algorithm;
Conference_Titel :
Progress in Informatics and Computing (PIC), 2010 IEEE International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-6788-4
DOI :
10.1109/PIC.2010.5687868