Astrophysical N-body simulations using hierarchical tree data structures
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
A parallel hashed Oct-Tree N-body algorithm
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Skeletons from the treecode closet
Journal of Computational Physics
Improving memory hierarchy performance for irregular applications
ICS '99 Proceedings of the 13th international conference on Supercomputing
The Mathematica book (4th edition)
The Mathematica book (4th edition)
Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves
Parallel Computing - Special issue on parallelization techniques for numerical modelling
Avalon: an Alpha/Linux cluster achieves 10 Gflops for $15k
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
High-density computing: a 240-processor Beowulf in one cubic meter
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
On Partitioning Dynamic Adaptive Grid Hierarchies
HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
Making a Case for Efficient Supercomputing
Queue - Power Management
A kernel-independent adaptive fast multipole algorithm in two and three dimensions
Journal of Computational Physics
The Space Simulator: Modeling the Universe from Supernovae to Cosmology
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
AM++: a generalized active message framework
Proceedings of the 19th international conference on Parallel architectures and compilation techniques
Cython: The Best of Both Worlds
Computing in Science and Engineering
A sparse octree gravitational N-body code that runs entirely on the GPU processor
Journal of Computational Physics
4.45 Pflops astrophysical N-body simulation on K computer: the gravitational trillion-body problem
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Hierarchical task mapping of cell-based AMR cosmology simulations
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Poster: The Hashed Oct-Tree N-Body Algorithm at a Petaflop
SCC '12 Proceedings of the 2012 SC Companion: High Performance Computing, Networking Storage and Analysis
Hi-index | 0.00 |
We report on improvements made over the past two decades to our adaptive treecode N-body method (HOT). A mathematical and computational approach to the cosmological N-body problem is described, with performance and scalability measured up to 256k (218) processors. We present error analysis and scientific application results from a series of more than ten 69 billion (40963) particle cosmological simulations, accounting for 4 x 1020 floating point operations. These results include the first simulations using the new constraints on the standard model of cosmology from the Planck satellite. Our simulations set a new standard for accuracy and scientific throughput, while meeting or exceeding the computational efficiency of the latest generation of hybrid TreePM N-body methods.