Sign inSign in
ConceptSystems & CS

Amdahl's law

A formula giving the theoretical maximum speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved.
as Onur Mutlu defines itETH ZürichThe wording closest to all 11 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Speedup5Parallelism2Concurrency1Enhanced fraction1Number of processors1Optimized portion fraction1Parallel computing1Parallel computing basics1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

6

Each in their own terms, from the easiest level.

  • Onur Mutlu

    ETH Zürich · Undergraduate

    • 58:12Problem Solving V: Digital Design and Computer Architecture (ETH Zürich, Spring 2025, Lecture 30)
    • 1:04:41GPU Architectures II & Memory Overview and Technology (ETH Zürich, Digital Design and Computer Architecture, Lecture 20)
    • 1:28:01Digital Design and Computer Architecture: Problem Solving IV (ETH Zürich, Spring 2025, Lecture 29)
    • 52:25SIMD Architectures
  • Tim Mattson

    Intel · Undergraduate

    The principle stating that the maximum possible speedup of a parallel program with an unlimited number of processors is one over the serial fraction.
    • 5:17Introduction to Parallel Programming with OpenMP (Part 2)
    • 6:16Programming Clusters (MPI) and GPUs
  • Charles Leiserson & Julian Shun

    MIT · Undergraduate

    A principle stating that the maximum speedup of a program is limited by its serial fraction, such that if a fraction alpha is serial, the maximum speedup is at most 1 over alpha.
    • 27:49Races and Parallelism
  • Martin Thompson

    GOTO Conferences · Undergraduate

    A formula showing the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved.
    • 10:04Mechanical Sympathy: Designing Software for Modern CPU Caches
  • Andrew Kelley

    Zig SHOWTIME · Undergraduate

    A formula giving the theoretical overall speedup in execution of the whole task at fixed workload that can be expected of a system whose resources are improved.
    • 19:24Handling Cancellation in Concurrent Systems
  • Andy Pavlo

    Carnegie Mellon University · Graduate

    A formula used to find the maximum expected improvement to an overall system when only a part of the system is improved.
    • 57:15Multi-Way Join Algorithms / Worst-Case Optimal Joins

Connections

17

The lectures that define it or assume it, and the concepts next to it.

6 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.