Scaled-Sized Model: A Revision of Amdahl's Law

摘要

The conventional argument, generally attributed to Amdahl, is that vector and parallel architectures should not be carried to extremes because the scalar or serial portion of the code will eventually dominate. Since pipeline stages and extra processors obviously add hardware cost, a corollary to this argument is that the most cost-effective computer is one based on uniprocessor, scalar principles. For architectures that are both parallel and vector, the argument is compounded, making it appear that near-optimal performance on such architectures is a near-impossibility. We present an argument based on the assumption that program execution time, not problem size, is constant for various amounts of vectorization and parallelism. This has a dramatic effect on Amdahl's argument, revealing that one can be much more optimistic about achieving high speedups on massively-parallel and highly-vectorized machines. The revised argument is supported by recent results of over 1000 times speedup on 1024 processors on several practical scientific applications. 3 refs., 6 figs. (ERA citation 13:032027)