Challenge¶
Amdahl's Law provides an equation that limits the expected speedup based on how much of an application is serialized.
$$ S_{latency}(s) = { 1 \over{(1 - p) + {p \over{s}}}} $$
Where:
- $S_{latency}$ is the theoretical speedup of the execution of the whole task;
- $s$ is the speedup of the part of the task that benefits from improved system resources;
- $p$ is the proportion of execution time that the part benefiting from improved resources originally occupied.
Amdahl's Law tells us the limit we can speed up any application is bounded by $1 \over{1 - p}$.