论文信息 - A portable distributed implementation of the parallel multipole tree algorithm

A portable distributed implementation of the parallel multipole tree algorithm

Several variants of parallel multipole-based algorithms have been implemented to further research in fields such as computational chemistry and astro-physics. We present a distributed parallel implementation of a multipole-based algorithm that is portable to a wide variety of applications and parallel platforms. Performance data are presented for loosely coupled networks of workstations as well as for more tightly coupled distributed multiprocessors, demonstrating the portability and scalability of the application to large number of processors.

John A. Board | William T. Rankin | J. Board | W. T. Rankin

[1] J.A. Board,et al. Scalable implementations of multipole-accelerated algorithms for molecular dynamics , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[2] Jack Dongarra,et al. PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing , 1995 .

[3] M. S. Warren,et al. A parallel hashed Oct-Tree N-body algorithm , 1993, Supercomputing '93.

[4] Z. S. Hakura,et al. Scalable Variants of Multipole-accelerated Algorithms for Molecular Dynamics Applications , 1995 .

[5] John A. Board,et al. Fast Fourier Transform Accelerated Fast Multipole Algorithm , 1996, SIAM J. Sci. Comput..

[6] J. L. Hennessy,et al. A parallel adaptive fast multipole method , 1993, Supercomputing '93.

[7] William Gropp,et al. A Parallel Version of the Fast Multipole Method-Invited Talk , 1987, PPSC.

[8] Piet Hut,et al. A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[9] L Greengard,et al. Fast Algorithms for Classical Physics , 1994, Science.

[10] Anoop Gupta,et al. A parallel adaptive fast multipole method , 1993, Supercomputing '93. Proceedings.

[11] Leslie Greengard,et al. A fast algorithm for particle simulations , 1987 .