AbstractWe present a new very fast tree-code which runs on massively parallel Graphical Processing Units (GPU) with NVIDIA CUDA architecture. The tree-construction and calculation of multipole moments is carried out on the host CPU, while the force calculation which consists of tree walks and evaluation of interaction list is carried out on the GPU. In this way we achieve a sustained performance of about 100GFLOP/s and data transfer rates of about 50GB/s. It takes about a second to compute forces on a million particles with an opening angle of θ≈0.5. The code has a convenient user interface and is freely available for use11http://castle.strw.leidenuniv.nl/software/octgrav.html.
To assess how future progress in gravitational microlensing computation at high optical depth will r...
We present an algorithm named "Chamomile Scheme". The scheme is fully optimized for calculating grav...
We describe a parallel version of our tree-code for the simulation of self-gravitating systems in As...
AbstractWe present a new very fast tree-code which runs on massively parallel Graphical Processing U...
We present the results of gravitational direct N-body simulations using the graphics processing unit...
AbstractWe have implemented a fast collisionless N-body code which runs on GPU, the peak performance...
AbstractThe tree method is a widely implemented algorithm for collisionless N-body simulations in as...
We present the results of gravitational direct $N$-body simulations using the commercial graphics pr...
We present preliminary results on the parallelization of a Tree-Code for evaluating gravitational fo...
The tree method is a widely implemented algorithm for collisionless N-body simulations in astrophysi...
In this short review we present the developments over the last 5 decades that have led to the use of...
In this short review we present the developments over the last 5 decades that have led to the use of...
I describe here the performances of a parallel treecode with individual particle timesteps. The code...
N-body problems, such as simulating the motion of stars in a galaxy and evaluating the spatial stati...
We describe in this paper an algorithm for solving the gravitational N-body problem using tree data ...
To assess how future progress in gravitational microlensing computation at high optical depth will r...
We present an algorithm named "Chamomile Scheme". The scheme is fully optimized for calculating grav...
We describe a parallel version of our tree-code for the simulation of self-gravitating systems in As...
AbstractWe present a new very fast tree-code which runs on massively parallel Graphical Processing U...
We present the results of gravitational direct N-body simulations using the graphics processing unit...
AbstractWe have implemented a fast collisionless N-body code which runs on GPU, the peak performance...
AbstractThe tree method is a widely implemented algorithm for collisionless N-body simulations in as...
We present the results of gravitational direct $N$-body simulations using the commercial graphics pr...
We present preliminary results on the parallelization of a Tree-Code for evaluating gravitational fo...
The tree method is a widely implemented algorithm for collisionless N-body simulations in astrophysi...
In this short review we present the developments over the last 5 decades that have led to the use of...
In this short review we present the developments over the last 5 decades that have led to the use of...
I describe here the performances of a parallel treecode with individual particle timesteps. The code...
N-body problems, such as simulating the motion of stars in a galaxy and evaluating the spatial stati...
We describe in this paper an algorithm for solving the gravitational N-body problem using tree data ...
To assess how future progress in gravitational microlensing computation at high optical depth will r...
We present an algorithm named "Chamomile Scheme". The scheme is fully optimized for calculating grav...
We describe a parallel version of our tree-code for the simulation of self-gravitating systems in As...