A fast algorithm for particle simulations
Journal of Computational Physics
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Computational structure of the N-body problem
SIAM Journal on Scientific and Statistical Computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Modeling Biomolecules: Larger Scales, Longer Durations
IEEE Computational Science & Engineering
IWIA '99 Proceedings of the 1999 International Workshop on Innovative Architecture
Grid-Enabled Applications in Molecular Dynamics Simulations Using a Cluster of Dedicated Computers
SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
| Hi-index | 0.00 |
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.