Reevaluating Amdahl's Law

Reevaluating Amdahl's Law (1988)

Cached

Download Links

[mprc.pku.edu.cn]
[impact.asu.edu]

Other Repositories/Bibliography

DBLP

by John L. Gustafson

Venue:	Communications of the ACM
Citations:	194 - 4 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Reevaluating Amdahl's Law	INFERENCE
AUTHOR NAME	John L. Gustafson	SVM HeaderParse 0.2
ABSTRACT	At Sandia National Laboratories, we are currently engaged in research involving massively-parallel processing. There is considerable skepticism regarding the viability of massive parallelism; the skepticism centers around Amdahl’s law, an argument put forth by Gene Amdahl in 1967 [1] that even when the fraction of serial work in a given problem is small, say s, the maximum speedup obtainable from even an infinite number of parallel processors is only 1/s. We now have timing results for a 1024-processor system that demonstrate that the assumptions underlying Amdahl’s 1967 argument are inappropriate for the current approach to massive ensemble parallelism. If N is the number of processors, s is the amount of time spent (by a serial processor) on serial parts of a program and p is the amount of time spent (by a serial processor) on parts of the program that can be done in parallel, then Amdahl’s law says that speedup is given by Speedup = (s + p) ⁄ ( s + p ⁄ N) = 1 ⁄ ( s + p ⁄ N), where we have set total time s␣+␣p ␣=␣1 for algebraic simplicity. For N = 1024, this is an unforgivingly steep function of s near s = 0 (see Figure 1). The steepness of the graph near s = 0 (approximately – N 2) implies that very few problems will experience even a 100-fold speedup. Yet for three very practical applications (s = 0.4 – 0.8 percent) used at Sandia, we have achieved the speedup factors on a 1024-processor hypercube which we believe are unprecedented [2]: 1021 for beam stress analysis using conjugate gradients, 1020 for baffled surface wave simulation using explicit finite differences, and 1016 for unstable fluid flow using flux-corrected transport. How can this be, when Amdahl’s argument would predict otherwise?	SVM HeaderParse 0.2
YEAR	1988	INFERENCE
VENUE	Communications of the ACM	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	532--533	INFERENCE
VOLUME	31	INFERENCE
CITATIONS	2 found	ParsCit 1.0