Amdahl's law
Amdahl's law is a formula in computer architecture.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2556050959
- Described as
- formula in computer architecture
- Other names
- Amdahl's argument
- What it is
- formula
- Named after
- Gene Amdahl
- Wikipedias with a page
- 31
Wikidata item Q460419 (wikidata.org/wiki/Q460419), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1385677198
In computer architecture, Amdahl's law (or Amdahl's argument) is a formula limiting the speedup of a task as resources are added to the system executing that task.
The law can be stated as:the overall performance improvement gained by optimizing a single part of a system is limited by the fraction of time that the improved part is actually used.
It is named after computer scientist Gene Amdahl, and was presented at the American Federation of Information Processing Societies (AFIPS) Spring Joint Computer Conference in 1967.
Amdahl's law is often used in parallel computing to predict the theoretical speedup when using multiple processors.
From the Wikipedia article “Amdahl's law” (en.wikipedia.org/wiki/Amdahl's_law), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
