Amdahl's Law

Bound the fixed-workload speedup from accelerating one fraction of execution while the unaffected fraction remains a limiting serial bottleneck.

Version

v3 · 2026-09-06 · History

Domain-specific #

1278

Origin domain

computer science

Subdomain

parallel computing

Aliases

Amdahl's argument

Core Idea

Amdahl's Law is a fixed-workload performance model. It states how much the execution time of one unchanged job can improve when only a fraction of that job benefits from an enhancement. Let the one-resource baseline time be normalized to (1). Let \(p\in[0,1]\) be the fraction of that baseline time that can be parallelized, and let (1-p) be the unaffected or serial fraction. If the parallelizable work is ideally divided among \(N\geq1\) identical processing resources, with no communication, synchronization, scheduling, or load-imbalance cost, then

Scope of Application

Amdahl's Law is used in parallel algorithm analysis, high-performance computing, multiprocessor design, hardware-accelerator evaluation, compiler optimization, database execution, and performance engineering. It supports strong-scaling analysis: hold problem size fixed and ask how execution time changes as processors increase. The same affected-fraction reasoning also evaluates nonparallel enhancements such as improving a memory operation, accelerating a kernel on a GPU, or replacing a subsystem, provided the baseline fractions and local acceleration are coherent.

Clarity

The most reliable reading separates three quantities. First, (p) is a fraction of baseline execution time, not the percentage of source lines, operations, or processors. Second, (S(N)) is whole-job speedup for a fixed workload, not the local acceleration (N) of the parallel part. Third, (E(N)=S(N)/N) is efficiency, not speedup.

Manages Complexity

The law compresses a complicated program and machine into two accounting classes plus one acceleration factor. That deliberate abstraction answers a high-value question without requiring instruction-level simulation: whether further investment in the enhanced component can materially improve end-to-end time. It exposes the difference between a large local gain and a small global gain, identifies when the limiting fraction deserves redesign, and prevents resource-count optimism from replacing workload accounting.

Abstract Reasoning

Amdahl's Law licenses several deductions. First, the asymptotic ceiling is set entirely by the unaffected fraction: reducing (1-p) can matter more than multiplying (N). Second, a target speedup (S^) requires (1-p<1/S^) even with unbounded acceleration. Third, for finite (N), solving (p=(1-1/S)/(1-1/N)) gives the ideal parallel fraction consistent with an observed speedup, provided the assumptions are credible. This inversion is algebraically the complement of the Karp–Flatt effective serial fraction.

Knowledge Transfer

Within computing, the exact pattern transfers from processor parallelism to vectorization, storage acceleration, network offload, database indexing, GPU kernels, and compiler optimization. The analyst identifies the fraction affected, estimates its local acceleration, and recombines it with untouched time. This is exact in-domain reuse because the quantities retain execution-time semantics.

The portable residue is a bottleneck principle: improving only one component yields an end-to-end gain bounded by the share of the outcome that component controls.

Relationships to Other Abstractions

Current abstraction Amdahl's Law Domain-specific

Parents (2) — more general patterns this builds on

• Amdahl's Law is a kind of Bottleneck Prime

  Bottleneck. The unaffected fraction instantiates a bottleneck: as (N) grows, it becomes the binding contribution to elapsed time and fixes the ceiling.

• Amdahl's Law is a kind of Scalability Prime

  Scalability. Amdahl's Law is a specific fixed-workload scalability model.

Hierarchy paths (4) — routes to 4 parentless roots

• Amdahl's Law → Bottleneck → Cut → Network → Reservoir-Flux Network → Conservation Laws → Invariance

Show alternative paths (3)

Neighborhood in Abstraction Space

Amdahl's Law sits in a sparse region of the domain-specific corpus (98^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Time-Saving Bias — 0.86
• Sun–Ni Law — 0.80
• Standard time (manufacturing) — 0.76
• Discount function — 0.74
• Waterfall Chart — 0.71

Computed from structural-signature embeddings · 2026-09-08