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.
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
6Each in their own terms, from the easiest level.
Onur Mutlu
Tim Mattson
The principle stating that the maximum possible speedup of a parallel program with an unlimited number of processors is one over the serial fraction.Charles Leiserson & Julian Shun
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.Martin Thompson
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.Andrew Kelley
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.Andy Pavlo
A formula used to find the maximum expected improvement to an overall system when only a part of the system is improved.
Connections
17The lectures that define it or assume it, and the concepts next to it.
Concepts6
Lectures11
- Races and Parallelism
- Problem Solving V: Digital Design and Computer Architecture (ETH Zürich, Spring 2025, Lecture 30)
- Introduction to Parallel Programming with OpenMP (Part 2)
- GPU Architectures (ETH Zürich, Digital Design and Computer Architecture, Lecture 19)
- GPU Architectures II & Memory Overview and Technology (ETH Zürich, Digital Design and Computer Architecture, Lecture 20)
- Digital Design and Computer Architecture: Problem Solving IV (ETH Zürich, Spring 2025, Lecture 29)