Amdahls law - calculate speed up performance, Computer Engineering

Assignment Help:

To calculate speed up performance various laws have been developed. These laws are discussed here.

 Amdahl's Law

Remember, the speed up factor helps us in knowing the relative gain achieved in shifting the implementation of a task from sequential computer to parallel computer and the performance does not enhance linearly with the increase in number of processors. Due to the above reason of saturation in 1967 Amdahl's law was derived. Amdahl's law states that a program have two types of operations i.e. complete sequential operations which should be done sequentially and complete parallel operations which can be implemented on multiple processors. The statement of Amdahl's law can be described with the help of an example.

Let us take a problem say P which has to be solved using a parallel computer. According to Amdahl's law, there are generally two types of operations. Thus, the problem will have some sequential operations and some parallel operations. We already know that it needs T (1) amount of time to implement a problem using a sequential algorithm and sequential machine. The time to compute the sequential operation is a fraction α (alpha) (α ≤ 1) of the total implementation time i.e. T (1) and the time to compute the parallel operations is (1- α). Thus, S (N) can be calculated as under:

512_Amdahls Law - Calculate speed up performance.png


Related Discussions:- Amdahls law - calculate speed up performance

Will case infer priority register if yes how give an example, Will case inf...

Will case infer priority register if yes how give an example? Yes case can infer priority register depending on coding style reg r; // Priority encoded mux, always @

Communication traffic and message queues, The Communication Traffic gives a...

The Communication Traffic gives a pictorial view of the communication traffic in the interconnection network with respect to the time in progress. The Communication Traffic shows t

Essential features of an algorithm, Necessary features of an algorithm: ...

Necessary features of an algorithm: 1.Input: The algorithm should take zero or more input. 2. Output: The algorithm should generate one or more outputs.  3. Definiteness:

Assembler directives, What are assembler directives? Ans: These are th...

What are assembler directives? Ans: These are the instructions that direct the program to be executed. They have no binary corresponding so they are called pseudo-opcodes. The

Explian service topologies, Explian Service Topologies Service Topolog...

Explian Service Topologies Service Topologies In a service-based architecture there increase dependencies between services resulting from cooperation

What do you understand by scan codes, Q. What do you understand by Scan Cod...

Q. What do you understand by Scan Codes? A scan code is a code produced by a microprocessor in keyboard when a key is pressed and is unique to key struck. When this code is rec

Truth tables - artificial intelligence, Truth Tables - artificial intellige...

Truth Tables - artificial intelligence: In propositional logic, where we are limited to expressing sentences where propositions are true or false - we can check whether a speci

Associative mapping - computer architecture, Associative Mapping: It i...

Associative Mapping: It is a more flexible mapping technique A primary memory block can be placed into any specific cache block position. Space in the cache may be

Visual basic applications in general context, Describe some general uses fo...

Describe some general uses for Visual basic applications in general context? Ans) Visual basic can be used within almost all Microsoft products such as Map point, Visio, Auto ca

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