A Massively Parallel Fast Multipole Algorithm in Three Dimensions

Abstract

The simulation of many-body, many-particle system has a wide range of applications in areas 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 O(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 to O(N). In this paper, we design an efficient parallel fast multipole algorithm in three dimensions. For portability, our parallel program is implemented using Message Passing Interface. Is it possible to obtain high performance for a computing intensive application out of a LAN of workstations? In this paper, we also attempted to answer this commonly asked question by those researchers who have no access to parallel computers or supercomputers.

DOI: 10.1109/HPDC.1996.546172

Extracted Key Phrases

14 Figures and Tables

Cite this paper

@inproceedings{Lu1996AMP, title={A Massively Parallel Fast Multipole Algorithm in Three Dimensions}, author={Eric Jui-Lin Lu and Daniel I. Okunbor}, booktitle={HPDC}, year={1996} }