Gustafsons law, Computer Engineering

Assignment Help:

Amdahl's law is suitable for applications where response time is critical. On the other hand, there are a lot of applications which need that accuracy of the resultant output should be high. In the current situation, the computing power has increased substantially due to increase in number of processors attached to a parallel computer. Therefore it is possible to increase the size of the problem i.e., the workload can be enlarged. How does this operate? Gustafson's Law relaxed the restriction of fixed size of difficulty and aimed at using the notion of constant implementation time in order to overcome the sequential bottleneck encountered in Amdahl's Law. This situation which does not suppose a fixed workload is analyzed by Gustafson. Therefore, Gustafson's Law suppose that the workload may increase substantially, with the number of processors but the whole implementation time should remain the similar as highlighted in Figures shown below.

2343_Gustafsons Law.png

Number of Processors

Parallel Load Increases for Gustafson's Law

 According to Gustafson's Law, if the amount of parallel operations for a problem increases sufficiently, then the sequential operations will no longer be a bottleneck.


Related Discussions:- Gustafsons law

Fetching a word from memory - computer architecture, Fetching a word from m...

Fetching a word from memory: CPU transfers the address of the needed information word to the memory address register (MAR). Address of the needed word is transferred to the pr

Find the complement of following functions, Q. Find the complement of follo...

Q. Find the complement of following functions and reduce to minimum literals 1. (A+C+D) (A+C+D') (A+C'+D)(A+D') 2. ABC(ABC' + AB'C + A'BC) 3. AB + AB' + A'C +A'C'

Define top-down parsing techniques, Define Top-down parsing Techniques ...

Define Top-down parsing Techniques Top-down parsing can be observed as an attempt to find left-most derivations of an input-stream through searching for parse trees using a top

Explain the reference count - free memory areas, Explain the Reference Coun...

Explain the Reference Count The system relates a reference count along with each memory area to point out the number of its active users. This number is incremented while a us

Write the binary representation of an integer number, The integer n = 3,510...

The integer n = 3,510,593 has hexadecimal representation 0x00359141 (check this with your d2h program), while the double precision, floating-point number 3510593.0 has hexadecimal

Explain the concept of generalization, Explain the concept of Generalizatio...

Explain the concept of Generalization Generalization and inheritance are powerful abstractions for sharing the structure and/or behaviour of more than one class.  Generalizati

Representation scheme in artificial intelligence, Representation scheme in ...

Representation scheme in artificial intelligence: It is not hard to see why logic has been popular representation scheme in AI: In this way, It is easy to represent knowl

Illustrate master-slave flip-flop, Q. Illustrate Master-Slave Flip-Flop? ...

Q. Illustrate Master-Slave Flip-Flop? Master slave flip-flop comprise two flip-flops. One is master flip-flop and other one is known as slave flip-flop. Fig below shows impleme

How many types of stages include in process of data mining, How many types ...

How many types of stages include in process of data mining? The process of data mining comprised three stages as given below: a) The initial exploration b) Model buildin

What is a multitape tm, What is a multitape TM?  A  multi-tape  Turing ...

What is a multitape TM?  A  multi-tape  Turing  machine  having  of  a  finite  control  with  k-tape  heads  and k-tapes each tape is infinite in both directions. On a one mov

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd