Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities.¶
Amdahl, G. M. (1967). Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities. Proceedings of the April 18–20, 1967 Spring Joint Computer Conference, 30, 18-20.
Cited by¶
9 citations across 9 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Bottleneck
- Amdahl's law formalizes the ceiling: the maximum speedup from parallelizing a program is bounded by the fraction that remains inherently serial, so the serial fraction is the computational bottleneck no amount of added cores can overcome.
This sourceAFIPS. Establishes Amdahl's law: the maximum speedup from parallelization is bounded by the inherently serial fraction, making that fraction the bottleneck on speedup.
- Amdahl's law formalizes the ceiling: the maximum speedup from parallelizing a program is bounded by the fraction that remains inherently serial, so the serial fraction is the computational bottleneck no amount of added cores can overcome.
- Concurrency
- Speed-up potential versus coordination overhead trade-off
This sourceSUPPORTS marker 051 (speed-up potential vs coordination overhead trade-off). DOI verified.
- Speed-up potential versus coordination overhead trade-off
- Irreducible Floor
- Manufacturing quality: a given process variance produces a defect-rate floor, and pushing for "zero defects" inside that process either inflates inspection cost or destabilises the process; lowering the floor requires process redesign, not more inspection. Network and software performance: irreducible latency (physical propagation plus minimum processing) and Amdahl's-law speedup limits (the serial fraction bounds achievable speedup regardless of core count) are floors no intra-regime tuning can pierce.
This sourceStates Amdahl's law: the serial fraction s bounds achievable speedup at 1/s regardless of processor count, setting an execution-time floor.
- Manufacturing quality: a given process variance produces a defect-rate floor, and pushing for "zero defects" inside that process either inflates inspection cost or destabilises the process; lowering the floor requires process redesign, not more inspection. Network and software performance: irreducible latency (physical propagation plus minimum processing) and Amdahl's-law speedup limits (the serial fraction bounds achievable speedup regardless of core count) are floors no intra-regime tuning can pierce.
- Premature Optimization
- Scalability
- Scale
Domain-specific¶
- Amdahl's Law
- Gene Amdahl's 1967 paper made the underlying argument while challenging projections for large-scale parallel organization; later performance literature commonly presents the normalized equation above as Amdahl's Law.
This sourceFoundational primary source; bibliographic identity verified through ACM.
- Gene Amdahl's 1967 paper made the underlying argument while challenging projections for large-scale parallel organization; later performance literature commonly presents the normalized equation above as Amdahl's Law.
- Sun–Ni Law
Mechanisms¶
- Parallel Server Activation
- Parallel speedup is bounded by whatever remains serial: past a point, more instances just heap load onto the one shared database and throughput flattens or degrades (Amdahl's Law
This sourceShows that a serial fraction imposes an upper bound on parallel speedup, so returns eventually flatten.
- Parallel speedup is bounded by whatever remains serial: past a point, more instances just heap load onto the one shared database and throughput flattens or degrades (Amdahl's Law
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:2ae8547511ef · see in the full table