Long-ranged interactions play an important role in many application domains using particle-based computational modelling.We present PEPC, a tree code developed at JSC that acceleratesthe computation of various forms of long-ranged interactions includingelectrostatics, Newtonian gravity, vortex dynamics, and smoothed particle hydrodynamics.PEPC implements optimised forms of both the classic Barnes Hut tree code algorithm and Dual-Tree Traversal showing scalabilty across 458 752 cores of JUQUEEN
We present a tree-code for integrating the equations of the motion of collisionless systems, which h...
This paper describes the implementation of a fast N-body algorithm for the study of multi-lament vor...
We have developed a new parallel tree method which will be called the forest method hereafter. This ...
The PEPC project (Pretty Efficient Parallel Coulomb Solver) is a public tree code that has been deve...
The efficient parallelization of fast multipole-based algorithms for the N-body problem is one of th...
An parallel tree code for rapid computation of long-range Coulomb forces based on the Warren-Salmon ...
Fortran 90 codes for particle-cluster and cluster-particle algorithms for fast evaluations of electr...
I describe here the performance of a parallel treecode with individual particle timesteps. The code ...
The challenging problems arising from fast parallel N-body simulations became a driver for high perf...
I describe here the performances of a parallel treecode with individual particle timesteps. The code...
We describe our implementation of the parallel hashed oct-tree (HOT) code, and in particular its app...
Abstract We discuss the performance characteristics of using the modification of the tree code sugge...
Approximation Scheme in Space and Time. The naive use of increasingly more processors for a fixed-si...
Tree-based algorithms for spatial domains scale poorly without extensive experimentation, especiall...
An improved implementation of an N-body code for simulating collisionless cosmological dynamics is p...
We present a tree-code for integrating the equations of the motion of collisionless systems, which h...
This paper describes the implementation of a fast N-body algorithm for the study of multi-lament vor...
We have developed a new parallel tree method which will be called the forest method hereafter. This ...
The PEPC project (Pretty Efficient Parallel Coulomb Solver) is a public tree code that has been deve...
The efficient parallelization of fast multipole-based algorithms for the N-body problem is one of th...
An parallel tree code for rapid computation of long-range Coulomb forces based on the Warren-Salmon ...
Fortran 90 codes for particle-cluster and cluster-particle algorithms for fast evaluations of electr...
I describe here the performance of a parallel treecode with individual particle timesteps. The code ...
The challenging problems arising from fast parallel N-body simulations became a driver for high perf...
I describe here the performances of a parallel treecode with individual particle timesteps. The code...
We describe our implementation of the parallel hashed oct-tree (HOT) code, and in particular its app...
Abstract We discuss the performance characteristics of using the modification of the tree code sugge...
Approximation Scheme in Space and Time. The naive use of increasingly more processors for a fixed-si...
Tree-based algorithms for spatial domains scale poorly without extensive experimentation, especiall...
An improved implementation of an N-body code for simulating collisionless cosmological dynamics is p...
We present a tree-code for integrating the equations of the motion of collisionless systems, which h...
This paper describes the implementation of a fast N-body algorithm for the study of multi-lament vor...
We have developed a new parallel tree method which will be called the forest method hereafter. This ...