Basic HTML version of Foils prepared 27 October 1997

Foil 10 First two Solutions of O(N2) Computational Complexity

From Master Set of Foils for GEM Computational Science Presentation GEM WorkShop Santa Fe -- 24-25 October 97. by Geoffrey C. Fox
1 1) Ignore it and implement straightforwardly on a conventional computer
2 2) Note that one can build special purpose parallel machines as need less communication bandwidth (and just one dimensional pipeline) and much less memory per CPU power than for general purpose (parallel) computer
  • parallel algorithm well known and incredibly efficient
  • This is approach of GRAPE (Gravity Pipeline) machine which could be about a factor of 100 more cost effective for astrophysics on large problems
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