CHAPTER 6 An Efficient CUDAImplementation of theTree-Based Barnes Hut n-Body Algorithm

@inproceedings{Burtscher2011CHAPTER6A,
  title={CHAPTER 6 An Efficient CUDAImplementation of theTree-Based Barnes Hut n-Body Algorithm},
  author={Martin Burtscher},
  year={2011}
}
This chapter describes the first CUDA implementation of the classical Barnes Hut n-body algorithm that runs entirely on the GPU. Unlike most other CUDA programs, our code builds an irregular treebased data structure and performs complex traversals on it. It consists of six GPU kernels. The kernels are optimized to minimize memory accesses and thread divergence and are fully parallelized within and across blocks. Our CUDA code takes 5.2 seconds to simulate one time step with 5,000,000 bodies on… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Fast n-body simulation with CUDA

  • L. Nyland, M. Harris, J. Prins
  • GPU Gems
  • 2007
1 Excerpt

A modified tree code: don’t laugh; it runs

  • J. Barnes
  • J. Comput. Phys
  • 1990
1 Excerpt

On the problem of distribution in globular star clusters

  • L. Nyland, M. Harris, J. Prins
  • Mon . Not . R . Astron . Soc .
  • 1911

On the problem of distribution in globular star clusters, Mon

  • H. C. Plummer
  • Not. R. Astron. Soc
  • 1911
1 Excerpt

Similar Papers

Loading similar papers…