HTML version of Scripted Foils prepared 18 Sept 1995

Foil 17 Amdahl's law for Real World Parallel Processing

From Second set of lectures on CPS615 Parallel Computing Overview CPS615 Basic Simulation Track for Computational Science -- Fall Semester 95. by Geoffrey C. Fox *
1 AMDAHL"s LAW or
2 Too many cooks spoil the broth
3 Says that
4 Speedup S is small if efficiency e small
5 or for Hadrian's wall
6 equivalently S is small if length l small
7 But this is irrelevant as we do not need parallel processing unless problem big!
Table Font Size

© 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 Fri Aug 15 1997