PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
create new user
forget your password?
Main Menu
speedup (Definition)

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

$\displaystyle 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.

"speedup" is owned by akrowne.
(view preamble)

View style:

Keywords:  parallel computing

Cross-references: Amdahl's Law, running, parallel
There are 3 references to this entry.

This is version 2 of speedup, born on 2001-12-22, modified 2002-03-13.
Object id is 1132, canonical name is Speedup.
Accessed 2251 times total.

AMS MSC68W40 (Computer science :: Algorithms :: Analysis of algorithms)
 68W10 (Computer science :: Algorithms :: Parallel algorithms)

Pending Errata and Addenda
Style: Expand: Order:
forum policy

No messages.

rate | post | correct | update request | add derivation | add example | add (any)