Copyright
Anne Greenbaum.

Parallelizing the adaptive fast multipole method on a shared memory MIMD machine online

. (page 1 of 2)
Online LibraryAnne GreenbaumParallelizing the adaptive fast multipole method on a shared memory MIMD machine → online text (page 1 of 2)
Font size
QR-code for this ebook


Parallelizing the Adaptive Fast Miiltipole Method on a Shared
Memory MIMD Machine

by
A. Greenhawn

Ultracomputer Note #162
June, 1989




Ultracomputer Research Laboratory



New York University

Courant Institute of Mathematical Sciences

Division of Computer Science

251 Mercer Street, New York, NY 10012



Parallelizing the Adaptive Fast Multipole Method on a Shared
Memory MIMD Machine

by
A. Greenhaum

Ultracomputer Note #162
June, 1989



ABSTRACT

The fast multipole method is a recently developed scheme Tor evaluating the
potential and force fields in . systems of particles whose interactions are
Coulombic or gravitational in nature. When the distribution of particles is
highly nonuniform, an adaptive version of the algorithm is needed. While the
nonadaptive algorithm can be parallelized on an SIMD machine, it is sliown
that the adaptive version is equally well parallelized on an MIMD ni;ichinc.
Shared memory and an atomic fetch-and-add instruction make implemcniation
especially easy. Results are presented on the 8-proccssor NYU Ultracomputer
Prototype.



This work was supported in part by the Applied M.-ilhematical Sciences Program of the US D.parlmcnl of En-
ergy under contract Dl, A(:n2-76rR()3n77 and by lli-•' ■•...




•-',•■


/:.'.*.'".


• »*.'


[• , ,




^i^r':






.'■' :>








0.9


a.




. »






>• •


■4;/


• ' ' '. u"




S..- ¥:■






Ur:




■■'■ 'I "•'


V. '\-








"^Vy;.:






'>•• i


.' »•• *w


1

Online LibraryAnne GreenbaumParallelizing the adaptive fast multipole method on a shared memory MIMD machine → online text (page 1 of 2)