Implementation of a parallel tree method on a GPU

@article{Nakasato2012ImplementationOA,
  title={Implementation of a parallel tree method on a GPU},
  author={N. Nakasato},
  journal={J. Comput. Sci.},
  year={2012},
  volume={3},
  pages={132-141}
}
  • N. Nakasato
  • Published 2012
  • Computer Science, Physics
  • J. Comput. Sci.
Abstract The k d-tree is a fundamental tool in computer science. Among other applications, the application of k d-tree search (by the tree method) to the fast evaluation of particle interactions and neighbor search is highly important, since the computational complexity of these problems is reduced from O ( N 2 ) for a brute force method to O ( N  log   N ) for the tree method, where N is the number of particles. In this paper, we present a parallel implementation of the tree method running on… Expand
Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs
Highly scalable implementation of an NN-body code on a GPU cluster
Tree structured data processing on GPUs
Astrophysical Particle Simulations on Heterogeneous CPU-GPU Systems
A Hybrid Parallel Barnes-Hut Algorithm for GPU and Multicore Architectures
GOTHIC: Gravitational oct-tree code accelerated by hierarchical time step controlling
Towards a GPU accelerated spatial computing framework
Approximate Nearest-Neighbour Fields via Massively-Parallel Propagation-Assisted K-D Trees
...
1
2
3
4
...

References

SHOWING 1-10 OF 49 REFERENCES
A parallel hashed oct-tree N-body algorithm
Vectorization of a treecode
Fast multipole methods on graphics processors
Vectorization of tree traversals
42 TFlops hierarchical N-body simulations on GPUs with applications in both astrophysics and turbulence
A modified tree code: don't laugh; it runs
...
1
2
3
4
5
...