Basic HTML version of Foils prepared 2 September 1997

Foil 36 General Formalism for Speed Up

From CPS615 Laplace Example -- Programming Models and Performance CPS615 Basic Simulation Track for Computational Science -- Fall Semester 97. by Geoffrey C. Fox
We look at speed up for this simple case
Suppose you run a problem on one processor - the sequential version
  • Let execution time be T1
Now run the "same" problem (definition of "same" can be tricky but it is not subtle here) on a parallel machine with P nodes where C.P.U. same as sequential machine Let execution time be TP
Then speed up is S=T1/TP
We would like S to be P What is it in our case and why ?

© 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 12 1999