Speedup and Efficiency
- (Absolute) Speedup: Sn = Ts/Tp(n).
- Ts ...time of sequential program.
- Tp(n) ...time of parallel program with n processors.
- 0 < Sn <=n (always?)
- Criterium for performance of parallel program.
- (Absolute) Efficiency: En = Sn/n.
- 0 < En <=1 (always?)
- Criterium for expenses of parallel program.
- Relative speedup and efficiency use Tp(1) instead of Ts.
- Tp(1) >=Ts (why?)
- Relative speedup and efficiency are larger than their absolute
counterparts.
Observations depend on (size of) input data.
Author: Wolfgang Schreiner
Last Modification: October 13, 1997