by Bédorf, Jeroen and Gaburov, Evghenii and Zwart, Simon Portegies
Submitted to Journal of Computational Physics. 34 pages, 13 figures, single column

We present parallel algorithms for constructing and traversing sparse octrees on graphics processing units (GPUs). The algorithms are based on parallel-scan and sort methods. To test the performance and feasibility, we implemented them in CUDA in the form of a gravitational tree-code which completely runs on the GPU.(The code is publicly available at: http://castle.strw.leidenuniv.nl/software.html) The tree construction and traverse algorithms are portable to many-core devices which have support for CUDA or OpenCL programming languages. The gravitational tree-code outperforms tuned CPU code during the tree-construction and shows a performance improvement of more than a factor 20 overall, resulting in a processing rate of more than 2.8 million particles per second.

by Herrmann, Frank and Silberholz, John and Bellone, Matias and Guerberoff, Gustavo and Tiglio, Manuel
Added one reference

We report on early results of a numerical and statistical study of binary black hole inspirals. The two black holes are evolved using post-Newtonian approximations starting with initially randomly distributed spin vectors. We characterize certain aspects of the distribution shortly before merger. In particular we note the uniform distribution of black hole spin vector dot products shortly before merger and a high correlation between the initial and final black hole spin vector dot products in the equal-mass, maximally spinning case. These simulations were performed on Graphics Processing Units, and we demonstrate a speed-up of a factor 50 over a more conventional CPU implementation.