What is gustafsons law, Computer Engineering

Assignment Help:

Q. What is Gustafsons Law?

Amdahl's law is appropriate for applications where response time is significant. On the other hand there are numerous applications that necessitate that accuracy of resultant output must be high. In present situation computing power has raised considerably because of increase in number of processors connected to parallel computer. So it is probable to raise size of problem that implies workload can be raised. How does this operate? Gustafson's Law relaxed limitation of fixed size of problem as well as aimed at employing notion of constant execution time in order to conquer sequential bottleneck encountered in Amdahl's Law. This condition that doesn't suppose a fixed workload is analysed by Gustafson.  So Gustafson's Law presumes the workload can increase considerably with number of processors however total execution time must remain same as highlighted in Figures below.

1373_What is Gustafsons Law2.png

Figure: Parallel Load Increases for Gustafson's Law

As said by Gustafson's Law if number of parallel operations for a problem raises satisfactorily then sequential operations would no longer be a bottleneck. The declaration of Gustafson's law should be illustrated with help of given example. Let's discuss a problem let's say P that has to be solved with the help of a parallel computer. Let Ts be time taken that is considered as constant for executing sequential operations. Let Tp (N, L) be time taken for running parallel operations with L as whole load on a parallel computer with N processors. The complete time taken for finding solution of problem is T=Ts + Tp. Consequently S (N) can be computed as under:

1264_What is Gustafsons Law1.png               

As well Tp (1, L)= N* Tp (N, L) it implies that time taken to execute parallel operations having a load of L on one processor is equal to N multiplied by time taken by one computer having N processor. If α be fraction of sequential load for a provided problem it implies that:

2132_What is Gustafsons Law3.png

Substituting Tp (1, L) = N* Tp (N, L) we get,

1466_What is Gustafsons Law4.png

Figure: Fixed Execution Time for Gustafson's Law

19_What is Gustafsons Law5.png

Let's change complete equation of S(N) in form of X. Now we get

            S(N) = α +N * (1-α)

S(N) = N -α * (N-1)

Now let's put a number of values of α as well as compute speed up factor for rising values of α it implies that sequential factor of work load for a fixed number of processors let's say N.  Figure explains a pictorial view of effect of Gustafson's Law on speed up factor. The graph illustrates as value of α rises speed up factor increases. This reduce is due to overhead caused by inter-processor communication.

405_What is Gustafsons Law6.png

Figure: S (N) vs. α αα α (Graph is not to scale)


Related Discussions:- What is gustafsons law

How does computer know that overflow has happened, Q. How does computer kno...

Q. How does computer know that overflow has happened? Illustration: Add numbers 65 and 75 in 8 bit register in signed 2's complement notation.  Here expected result is

Functions for various communication modes, Q. Functions for various communi...

Q. Functions for various communication modes? MPI offers both non-blocking and blocking send/transmitting and receive operations for all modes. Functions for various commun

With respect to security which is the better .net or j2ee, With respect to...

With respect to security, which one is the better choice?.Net or J2EE? Explain? As per majority programmers .NET is the best one which have one vendor compare to, the ease of

Illustrate working of synchronous counters, Q. Illustrate working of Synchr...

Q. Illustrate working of Synchronous Counters? The main drawback of ripple counter is delay in changing the value. How? To understand this let's take a case when state of rippl

Explain the term- signals, Explain the term- Signals -  Signals are use...

Explain the term- Signals -  Signals are used for communication between components -  Signals can be seen as real, physical signals -  Some delay should be incurred in a

Evaluate physical address of top of stack, Q. Evaluate Physical address of ...

Q. Evaluate Physical address of top of stack? Value of stack segment register (SS) = 6000h Value of stack pointer (SP) which is Offset = 0010h  So Physical address of top

Inheritance, what is Ambiguity in single inheritance

what is Ambiguity in single inheritance

Minimization of the logic function using k-maps, Minimize the logic functio...

Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using K-maps Ans. The logic function minimization of F(A, B, C, D) = ∑ m(1,3,5,8,9,11.15) + d(2,13) by

Program for interchanging the values of two memory locations, Q. Program fo...

Q. Program for interchanging the values of two Memory locations? Program for interchanging the values of two Memory locations  ; input: Two memory variables of same size:

For what DMSP stands, For what DMSP stands? DMSP stans here for Dist ri...

For what DMSP stands? DMSP stans here for Dist ributed Mai l system Protocol.

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