We describe PTreeSPH, a gravity treecode combined with an SPH hydrodynamics code designed for massively parallel supercomputers having distributed memory. Our computational algorithm is based on the popular TreeSPH code of Hernquist & Katz (1989). PTreeSPH utilizes a domain decomposition procedure and a synchronous hypercube communication paradigm to build self-contained subvolumes of the simulation on each processor at every timestep. Computations then proceed in a manner analogous to a serial code. We use the Message Passing Interface (MPI) communications package, making our code easily portable to a variety of parallel systems. PTreeSPH uses individual smoothing lengths and timesteps, with a communication algorithm designed to minimize e...
We have developed a new parallel tree method which will be called the forest method hereafter. This ...
I describe here the performance of a parallel treecode with individual particle timesteps. The code ...
Tree-based algorithms for spatial domains scale poorly without extensive experimentation, especiall...
We discuss the cosmological simulation code GADGET-2, a new massively parallel TreeSPH code, capable...
I describe here the performances of a parallel treecode with individual particle timesteps. The code...
An improved implementation of an N-body code for simulating collisionless cosmological dynamics is p...
We present preliminary results on the parallelization of a Tree-Code for evaluating gravitational fo...
We describe a new implementation of a parallel N-body tree code. The code is load-balanced using the...
We present a tree-code for integrating the equations of the motion of collisionless systems, which h...
We describe a hybrid technique for carrying out large N-Body simulations to study formation and evol...
We describe a parallel version of our tree-code for the simulation of self-gravitating systems in As...
A combined N-body/hydrodynamical code is presented. Hydrodynamical properties are determined using s...
We describe a parallel version of our tree-code for the simulation of self-gravitating systems in As...
The scientific target of my PhD activity in Astronomy, Astrophysics and Space Science, consists in s...
We describe our implementation of the parallel hashed oct-tree (HOT) code, and in particular its app...
We have developed a new parallel tree method which will be called the forest method hereafter. This ...
I describe here the performance of a parallel treecode with individual particle timesteps. The code ...
Tree-based algorithms for spatial domains scale poorly without extensive experimentation, especiall...
We discuss the cosmological simulation code GADGET-2, a new massively parallel TreeSPH code, capable...
I describe here the performances of a parallel treecode with individual particle timesteps. The code...
An improved implementation of an N-body code for simulating collisionless cosmological dynamics is p...
We present preliminary results on the parallelization of a Tree-Code for evaluating gravitational fo...
We describe a new implementation of a parallel N-body tree code. The code is load-balanced using the...
We present a tree-code for integrating the equations of the motion of collisionless systems, which h...
We describe a hybrid technique for carrying out large N-Body simulations to study formation and evol...
We describe a parallel version of our tree-code for the simulation of self-gravitating systems in As...
A combined N-body/hydrodynamical code is presented. Hydrodynamical properties are determined using s...
We describe a parallel version of our tree-code for the simulation of self-gravitating systems in As...
The scientific target of my PhD activity in Astronomy, Astrophysics and Space Science, consists in s...
We describe our implementation of the parallel hashed oct-tree (HOT) code, and in particular its app...
We have developed a new parallel tree method which will be called the forest method hereafter. This ...
I describe here the performance of a parallel treecode with individual particle timesteps. The code ...
Tree-based algorithms for spatial domains scale poorly without extensive experimentation, especiall...