A fast algorithm for particle simulations
Journal of Computational Physics
A bridging model for parallel computation
Communications of the ACM
The parallel multipole method on the connection machine
SIAM Journal on Scientific and Statistical Computing
A rapid hierarchical radiosity algorithm
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
An implementation of the fast multipole method without multipoles
SIAM Journal on Scientific and Statistical Computing
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
Experiences with parallel N-body simulation
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Using MPI: portable parallel programming with the message-passing interface
Using MPI: portable parallel programming with the message-passing interface
Programming parallel algorithms
Communications of the ACM
Towards efficiency and portability: programming with the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The parallel fast multipole method in molecular dynamics
The parallel fast multipole method in molecular dynamics
High performance Fortran for highly irregular problems
PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An {\it bf O(N)} Algorithm for Three-Dimensional N-body Simulations
An {\'it bf O(N)} Algorithm for Three-Dimensional N-body Simulations
Portable and Efficient Parallel Computing Using the BSP Model
IEEE Transactions on Computers
Efficient Java RMI for parallel programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Software Design Model for Parallel Applications on Heterogeneous Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Massively parallel implementation of a fast multipole method for distributed memory machines
Journal of Parallel and Distributed Computing
Satin: A high-level and efficient grid programming model
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementation of a hierarchical N-body simulator using the Ompss programming model
Proceedings of the first workshop on Irregular applications: architectures and algorithm
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
| Hi-index | 0.01 |
We describe the design of several portable and efficient parallel implementations of adaptive N-body methods, including the adaptive Fast Multipole Method, the adaptive version of Anderson's Method, and the Barnes-Hut algorithm. Our codes are based on a communication and work partitioning scheme that allows an efficient implementation of adaptive multipole methods even on high-latency systems. Our test runs demonstrate high performance and speedup on several parallel architectures, including traditional MPPs, shared-memory machines, and networks of workstations connected by Ethernet.