By Topic

Parallel implementation of 3D FMA using MPI

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 ; Okunbor, D.I.

The simulation of N-body systems has been used extensively in biophysics and chemistry to investigate the dynamics of biomolecules, and in astrophysics to study the chaotic characteristics of the galactic system. However, the long-range force calculation has a time complexity of O(N2), where N is the number of particles in the system. The fast multipole algorithm (FMA), proposed by Greengard and Rokhlin (1987), reduces the time complexity to O(N). Our goal is to build a parallel FMA library which is portable, scalable and efficient. We use the Message Passing Interface (MPI) as the communication back-end. Also, an effective communication scheme to reduce the communication overhead and a partitioning technique to obtain good load balancing among the processors were implemented into the library

Published in:

MPI Developer's Conference, 1996. Proceedings., Second

Date of Conference:

1-2 Jul 1996