Basic HTML version of Foils prepared April 22 2000

Foil 34 Sequential and Parallel Performance IV

From Parallel FFT and use in PDE Solvers Computational Science Class CPS615 -- Winter Semester 2000. by Geoffrey C. Fox
1 We can use the same idea to improve the parallel algorithm
2 Now the top P=logNproc digits label processor number and we transfer these to digits stored inside processor. This involves communication but after this transfer, all computations are internal to a processor
  • Total Communication time is 2(d-P). (1-2L) . Tcomm
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