Skip to content

Amdahl’s Law and Gustafson’s Law

December 5, 2009
tags:

Amdahl’s law states that the speedup achieved through parallelisation of a program is limited by the percentage of its workload that is inherently serial. We can get no more than a maximum speedup equal to 1 / (s + p / N ) where

s = the length of the serial part of the problem

p = the length of the parallel part of the problem

N = number of processors used

Amdahl's lawGustafson’s law states that , with increasing data size, the speedup obtained through parallelisation increases, because the parallel work increases(scales) with data size.

To those who took Amdahl’s law as an argument against Massively Parallel Processing, Gustafson’s law proves they are wrong.

Gustafson's Law

1. Today, Amdahl’s presumption of fixed data size is obviously a restriction which does not map into reality for many problems.

2. Both laws are in fact different perspective over the same truth – one sees data size as fixed and the other sees the relation as a function of data size.


About these ads
No comments yet

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Follow

Get every new post delivered to your Inbox.

%d bloggers like this: