By Topic

A massively parallel fast multipole algorithm in three dimensions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lu, E.J.-L. ; Dept. of Comput. Sci., Missouri Univ., Rolla, MO, USA ; Okunbor, D.I.

The simulation of many-body, many-particle systems has a wide range of applications in areas such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes 90% of the simulation time. This is mainly due to the fact that the total number of interactions in the force is O(N/sup 2/), where N is the number of particles in the system. The fast multipole algorithm proposed by Greengard and Rokhlin (1987) reduces the time complexity to O(N). In this paper, we design an efficient, parallel fast multipole algorithm in 3D. For portability, our parallel program is implemented using the Message Passing Interface. Is it possible to obtain high performance for a computationally-intensive application using a LAN of workstations? In this paper, we attempt to answer this question, which is commonly asked by those researchers who have no access to parallel computers or supercomputers.

Published in:

High Performance Distributed Computing, 1996., Proceedings of 5th IEEE International Symposium on

Date of Conference:

6-9 Aug. 1996