Basic HTML version of Foils prepared 27 October 1997

Foil 32 Parallel Algorithm in Fast Multipole I

From Master Set of Foils for GEM Computational Science Presentation GEM WorkShop Santa Fe -- 24-25 October 97. by Geoffrey C. Fox


1 Parallelism is clear -- update particles in parallel but what about communication?
2 It requires a thoughtful algorithm but can efficiently fetch information needed.
  • Fetch all the information needed by ANY particle in a given processor as multipole approach implies that particles tend to need same long range components if nearby
  • call this "locally essential" data
  • cf. O(N) multipole-multipole approach
3 Effectively top of tree replicated in all processors and tey just differ near bottom which is expanded in a way that depends on where processor is

in Table To:


© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Mon Oct 27 1997