An efficient CUDA implementation of the tree-based barnes hut n-body algorithm

GPU Computing Gems Emerald Edition

Volumn , Issue , 2011, Pages 75-92

  Burtscher, Martin ^a   Pingali, Keshav ^a  

^a TEXAS STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84858427151     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-0-12-384988-5.00006-1     Document Type: Chapter

References (7)

1. Barnes J., Hut P. A hierarchical O(n log n) force-calculation algorithm. Nature 1986, 324(4):446-449.
2. Plummer H.C. On the problem of distribution in globular star clusters. Mon. Not. R. Astron. Soc. 1911, 71:460-470.
3. Nyland L., Harris M., Prins J. Fast n-body simulation with CUDA. GPU Gems 2007, 3. Addison-Wesley Professional, (Chapter 31). H. Nguyen (Ed.).
4. T. Hamada, K. Nitadori, K. Benkrid, Y. Ohno, G. Morimoto, T. Masada, et al., A novel multiple-walk parallel algorithm for the Barnes-Hut treecode on GPUs - towards cost effective, high performance N-body simulation, vol. 24 (1-2), SpringerLink, Computer Science - Research and Development, Springer-Verlag, New York, 2009 (special issue paper).
5. CUDA Programming Guide, Version 2.2 2009, NVIDIA, NVIDIA Corp., Santa Clara, CA.
6. D. Kirk, W.W. Hwu, Lecture 10, http://courses.ece.illinois.edu/ece498/al/lectures/lecture10-control-flo w-spring-2010.ppt (accessed 06.11.10). http://courses.ece.illinois.edu/ece498/al/lectures/lecture10-control-flo w-spring-2010.ppt.
7. Barnes J. A modified tree code: don't laugh; it runs. J. Comput. Phys. 1990, 87(1):161-170.