IEEE Transactions on Computers
A fast algorithm for particle simulations
Journal of Computational Physics
Computational structure of the N-body problem
SIAM Journal on Scientific and Statistical Computing
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
The parallel multipole method on the connection machine
SIAM Journal on Scientific and Statistical Computing
An implementation of the fast multipole method without multipoles
SIAM Journal on Scientific and Statistical Computing
The order of Appel's algorithm
Information Processing Letters
Parallel hierarchical N-body methods
Parallel hierarchical N-body methods
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
A parallel adaptive fast multipole method
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
50 GFlops molecular dynamics on the Connection Machine 5
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
Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]
ACM Transactions on Mathematical Software (TOMS)
A Parallel Version of the Fast Multipole Method-Invited Talk
Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing
An {\it bf O(N)} Algorithm for Three-Dimensional N-body Simulations
An {\'it bf O(N)} Algorithm for Three-Dimensional N-body Simulations
A New Parallel Kernel-Independent Fast Multipole Method
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Massively parallel implementation of a fast multipole method for distributed memory machines
Journal of Parallel and Distributed Computing
Library support for parallel sorting in scientific computations
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
The O(N) hierarchical N-body algorithms and Massively Parallel Processors allow particle systems of 100 million particles or more to be simulated in acceptable time. We present a data-parallel implementation of Anderson's method and demonstrate both efficiency and scalability of the implementation on the Connection Machine CM-5/5E systems. The communication time for large particle systems amounts to about 10-25%, and the overall efficiency is about 35%. The evaluation of the potential field of a system of 100 million particles takes 3 minutes and 15 minutes on a 256 node CM-5E, giving expected four and seven digits of accuracy, respectively. The speed of the code scales linearly with the number of processors and number of particles.