Abstract
The simulation of many-body, many-particle system has a wide range of applications in area such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the simulation time. This is mainly due to the fact that the total number of interactions in the force is 0( N 2 ), where N is the number of particles in the system. The fast multipole algorithm, proposed by Greengard and Rokhlin, reduces the time complexity of the force calculation to O(N). We implement the fast multipole algorithm, using MPI, based on optimal communication scheme which minimizes the communication and synchronization overhead. The parallel fast multipole algorithm presented here is scalable and portable.
Recommended Citation
Okunbor, Daniel and Lu, Eric Jui-Lin, "Parallel Fast Multipole Algorithm using MPI" (1995). Computer Science Technical Reports. 185.
https://scholarsmine.mst.edu/comsci_techreports/185
Department(s)
Computer Science
Report Number
CSc-95-08
Document Type
Technical Report
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1995 University of Missouri - Rolla, All rights reserved
Publication Date
28 June, 1995
Comments
Both Authors are Graduate Students.This report is to appear in the proceedings of MPI Developers Conference '95