Basic HTML version of Foils prepared April 22 2000

Foil 33 Sequential and Parallel Performance III

From Parallel FFT and use in PDE Solvers Computational Science Class CPS615 -- Winter Semester 2000. by Geoffrey C. Fox
1 Interesting point about swapping time is that it is independent of L except for the factor (1-2L) which is a factor of two increase from L=1 to largest L
2 After spending this time, one can then do "in-cache" computations even in an iterative algorithm
3 Computations are larger by a factor L (roughly log of Cache Size) compared to cost of re-ordering
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 Apr 24 2000