Modernizing Amdahl's Law: How AI Scaling Laws Shape Computer Architecture
Chien-Ping Lu

TL;DR
This paper redefines Amdahl's Law to better model modern heterogeneous systems, emphasizing resource allocation, workload variability, and specialization efficiency in AI-driven computing architectures.
Contribution
It introduces a new formulation of Amdahl's Law incorporating scalable workload fractions and efficiency ratios, explaining the shift towards more programmable hardware in AI workloads.
Findings
Identifies a critical scalable fraction threshold for specialization benefits.
Derives a minimum efficiency ratio needed for hardware specialization.
Explains the migration of value to learned computation in modern architectures.
Abstract
Classical Amdahl's Law conceptualized the limit of speedup for an era of fixed serial-parallel decomposition and homogeneous replication. Modern heterogeneous systems need a different conceptual framework: constrained resources must be allocated across heterogeneous hardware while workloads themselves change, with some stages becoming effectively bounded and others continuing to absorb additional effective compute. This paper reformulates Amdahl's Law around that shift. We replace processor count with an allocation variable, replace the classical parallel fraction with a value-scalable fraction, and model specialization by a relative efficiency ratio between dedicated and programmable compute. The resulting objective yields a finite collapse threshold. For a specialized efficiency ratio R, there is a critical scalable fraction S_c = 1 - 1/R beyond which the optimal allocation to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
