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. 1
|
970
|
A bridging model for parallel computation
– Valiant
- 1997
|
|
740
|
Using MPI: Portable Parallel Programming with the Message Passing Interface, 2nd edition
– Gropp, Lusk, et al.
- 1999
|
|
398
|
A fast algorithm for particle simulations
– Greengard, Rokhlin
- 1987
|
|
329
|
A rapid hierarchical radiosity algorithm
– Hanrahan, Salzman, et al.
- 1991
|
|
134
|
A hierarchical O(N log N) force-calculation algorithm
– Barnes, Hut
- 1986
|
|
125
|
Programming parallel algorithms
– Blelloch
- 1996
|
|
124
|
A parallel hashed oct-tree n-body algorithm
– Warren, Salmon
- 1993
|
|
119
|
An efficient program for many-body simulation
– Appel
- 1985
|
|
88
|
A fast adaptive multipole algorithm for particle simulations
– Carrier, Greengard, et al.
- 1988
|
|
81
|
Astrophysical N-body Simulations Using Hierarchical Tree Data Structures
– Warren, Salmon
- 1992
|
|
66
|
An implementation of the fast multipole method without multipoles
– Anderson
- 1992
|
|
58
|
Parallel Hierarchical N-body Methods and their Implications for Multiprocessors
– Singh
- 1993
|
|
43
|
A Portable Parallel Particle Program
– Warren, Salmon
- 1995
|
|
41
|
The parallel multipole method on the connection machine
– Zhao, Johnsson
- 1991
|
|
41
|
An O(N) Algorithm for Three-Dimensional N-Body Simulations, AI-TR-995
– Zhao
- 1987
|
|
40
|
Implementing the fast multipole method in three dimensions
– Schmidt, Lee
- 1991
|
|
34
|
High Performance Fortran for highly irregular problems
– Hu, Johnsson, et al.
- 1997
|
|
21
|
Experiences with parallel N-body simulation
– Liu, Bhatt
- 1994
|
|
19
|
A Practical Comparison of N-Body Algorithms. Parallel Algorithms
– Blelloch, Narlikar
- 1997
|
|
12
|
A data-parallel implementation of the adaptive fast multipole algorithm
– Nyland, Prins, et al.
- 1993
|
|
9
|
Performance characteristics of tree codes
– Hernquist
- 1987
|
|
9
|
An improved fast multipole algorithm for potential fields
– Hrycak, Rokhlin
- 1995
|
|
9
|
A Data Parallel Implementation of Hierarchical N–body Methods
– Hu, Johnsson
- 1996
|
|
7
|
Scalable variants of multipole-based algorithms for molecular dynamics applications
– Board, Hakura, et al.
- 1995
|
|
7
|
A data-parallel adaptive N-body method
– Hu, Johnsson, et al.
- 1997
|
|
4
|
Torsten Suel, and Thanasis Tsantilas. Towards efficiency and portability: Programming with the BSP model
– Goudreau, Lang, et al.
- 1996
|
|
4
|
The Parallel Fast Multipole Method in Molecular Dynamics
– Singer
- 1995
|
|
3
|
A parallel adaptive fast multipole algorithm for N-body problems
– Krishnan, Kale
- 1995
|
|
2
|
From Sir Isaac to the Sloan survey: Calculating the structure and chaos owing to gravity in the universe
– Lake, Quinn, et al.
- 1997
|
|
1
|
Parallelizing the adaptive fast multipole method on a shared memory MIMD machine. NYU Ultracomputer Note 162
– Greenbaum
- 1989
|
|
