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

What is write miss, What is write miss? During the write operation if t...

What is write miss? During the write operation if the addressed word is not in cache then said to be write miss.

Determine the number of classes of ip addresses, The total number of class ...

The total number of class of IP address are? The total number of class of IP addresses are 5.

Define opcode and operands, Q. Define Opcode and Operands? The most com...

Q. Define Opcode and Operands? The most common fields which are found in instruction formats are: Opcode: (What operation to perform?)  An operation code field cal

Multi-layer network architectures, Multi-Layer Network Architectures: ...

Multi-Layer Network Architectures: As we considered we saw in the previous lecture that perceptrons have limited scope in the type of concepts that they can learn - but they c

Explain about the term intranet in brief, Explain about the term Intranet i...

Explain about the term Intranet in brief. Intranet: An Intranet is a form of information system which facilitates communication into the organizations in between widely

Model a disaster recovery system for the cyber city, Question: (a) Stat...

Question: (a) State possible Large Scale System Applications different from those mentioned in (c) which may have a component running in the Cyber City. (b) According to you

Explain busy waiting semaphores, Explain busy waiting semaphores. Weak,...

Explain busy waiting semaphores. Weak, Busy-wait Semaphores: The simplest method to implement semaphores. Useful while critical sections last for a short time, or we

Explain working of counters, Q. Explain working of Counters? A counter ...

Q. Explain working of Counters? A counter is a register that goes through a predetermined sequence of states when clock pulse is applied. In principle value of counters is incr

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