Reevaluating Amdahl's Law.

Gustafson, J. L. (1988). Reevaluating Amdahl's Law. Communications of the ACM, 31(5), 532-533.

Type

Journal article

Intellectual base

Primary research

Year

1988

Volume

31

Issue

5

Pages

532-533

DOI

10.1145/42411.42415

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/42411.42415

Cited from

computer_science, logistics_supply_chain

Cited by

5 citations across 5 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Bottleneck

  • This sourceScaled-speedup counterpoint to Amdahl's law for problems that grow with processor count. Biblio reference (never cited in body).

• Concurrency

  • This sourceProposes scaled (fixed-time) speedup, countering Amdahl's fixed-problem-size assumption. DOI verified.

• Scalability
  • Listed in the references but not attached to a specific claim.

Domain-specific

• Amdahl's Law
  • Their larger speedups answer different questions.

    This sourcePrimary scaled/fixed-time contrast.

• Sun–Ni Law
  • is Gustafson's scaled-speedup formula.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 5 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:1912deeca9c2 · see in the full table