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

Is dos a real time os, DOS is not a RTOS (real time Operating system), thou...

DOS is not a RTOS (real time Operating system), though MS DOS can be used with certain APIs to attain the RTOS functionality. For example, the RT Kernel (Real Time Kernel) which ca

Prolog programming language - artificial intelligence, Prolog Programming L...

Prolog Programming Language - Artificial intelligence: Most of the programming languages are procedural: the programmer specifies exactly the correct instructions (algorithms)

How would you implement inheritance using vb.net/c#, How would you implemen...

How would you implement inheritance using VB.NET/C#? When we set out to execute a class using inheritance, we must first start with an existing class from which we will derive

Explain in detail about the dynamic timing, Explain in detail about the Dyn...

Explain in detail about the Dynamic timing a. Design is simulated in full timing mode. b. Not all possibilities tested, as it is dependent on input test vectors. c. Simul

Recombination and mutation, Recombination and Mutation: In such a scen...

Recombination and Mutation: In such a scenario the point of GAs is to generate population after population of individuals that represent possible solutions to the problem at h

Effective collaborative computing, Explain how the Web enables effective co...

Explain how the Web enables effective collaborative computing. Discuss the similarities and differences among WebEx, Microsoft NetMeeting and Novell Groupwise software (in less tha

What is double entry - verification, What is Double entry - Verification ...

What is Double entry - Verification In this approach, data is entered twice (using two different people); data is only accepted if both versions match up. Generally used to ve

Explain booth''s multiplication algorithm, Computer Organization 1. Dr...

Computer Organization 1. Draw a flowchart of a Booth's multiplication algorithm and explain it. 2. What is the concept of memory interleaving? 3. Explain virtual memory? Expla

What are multi-cycle paths, What are multi-cycle paths? Multi-cycle pat...

What are multi-cycle paths? Multi-cycle paths are paths among registers which take more than one clock cycle to turn out to be stable. For illustration analyzing the de

Explain bottom-up parsing techniques, Explain Bottom-up Parsing Techniques ...

Explain Bottom-up Parsing Techniques A parser can begin with the input and attempt to rewrite it to the start symbol. Instinctively, the parser attempts to locate the most bas

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