Basic HTML version of Foils prepared April 22 2000

Foil 29 Performance of Simplest Parallel DIT FFT V

From Parallel FFT and use in PDE Solvers Computational Science Class CPS615 -- Winter Semester 2000. by Geoffrey C. Fox
1 Alternatively we could send even members of fa to b and odd indexed entries in fb to a.
  • We would take resultant vector members in processors a and b and combine them in pairs to get FFT components
2 Communication overhead fcomm = Tparallel *Nproc/Tsequential -1 is now given by
3
4 We have avoided load imbalance and halved the communication
5 compared to simple algorithm. In later foils we will find even better
6 methods that get rid of log2N term
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