Speedup is a way to quantify the advantage of using a parallel algorithm over a sequential algorithm. The speedup is defined as
Where is the running time of the best available sequential algorithm and is the running time of the parallel algorithm.
Ideally, on a system with processors, the speedup for any algorithm would be . Amdahl’s law deals with the speedup in more realistic situations.
|Date of creation||2013-03-22 12:04:12|
|Last modified on||2013-03-22 12:04:12|
|Last modified by||akrowne (2)|