A portable distributed implementation of the parallel multipole tree algorithm
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- Scalable implementations of multipole-accelerated algorithms for molecular dynamicsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast Fourier Transform Accelerated Fast Multipole AlgorithmSIAM Journal on Scientific Computing, 1996
- PVMPublished by MIT Press ,1994
- Fast Algorithms for Classical PhysicsScience, 1994
- A parallel adaptive fast multipole methodPublished by Association for Computing Machinery (ACM) ,1993
- A parallel hashed Oct-Tree N-body algorithmPublished by Association for Computing Machinery (ACM) ,1993
- The Rapid Evaluation of Potential Fields in Particle SystemsPublished by MIT Press ,1988
- A fast algorithm for particle simulationsJournal of Computational Physics, 1987
- A hierarchical O(N log N) force-calculation algorithmNature, 1986