Basic HTML version of Foils prepared April 7,1995

Foil 37 Some very hard Loosely Synchronous Problems -- HPF Expression uncertain

From Programming Paradigms B CRPC/MCNC Workshop -- April 10-13 1995. by Geoffrey C. Fox
1 Direct methods for sparse matrix solvers
  • Hard to parallelize
2 O(N) and O(NlogN) fast multipole methods for particle dynamics
  • Data structure is an adaptive tree aligned with underlying spatial topology - hard to parallelize but performance is wonderful
  • Definitely need MIMD to get good performance
3 Original message passing code (Salmon thesis) won "Intel Delta Application Prize"
  • Impossible in HPF or extension
4 Current version (Warren and Salmon) looks possible with extended PARTI
5 Interesting Parallel C++ work
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 Sun Feb 22 1998