

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.

"speedup" is owned by akrowne.


(view preamble)
Keywords: 
parallel computing 
Crossreferences: Amdahl's Law, running, parallel
There are 3 references to this entry.
This is version 2 of speedup, born on 20011222, modified 20020313.
Object id is 1132, canonical name is Speedup.
Accessed 2251 times total.
Classification:
AMS MSC:  68W40 (Computer science :: Algorithms :: Analysis of algorithms)   68W10 (Computer science :: Algorithms :: Parallel algorithms) 



Pending Errata and Addenda







