# speedup

Speedup is a way to quantify the advantage of using a parallel algorithm over a sequential algorithm. The speedup $S$ is defined as

 $S=\frac{R}{P}$

Where $R$ is the running time of the best available sequential algorithm and $P$ is the running time of the parallel algorithm.

Ideally, on a system with $N$ processors, the speedup for any algorithm would be $N$. Amdahl’s law deals with the speedup in more realistic situations.

Title speedup Speedup 2013-03-22 12:04:12 2013-03-22 12:04:12 akrowne (2) akrowne (2) 6 akrowne (2) Definition msc 68W40 msc 68W10