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

Explain about magnetic disk, Q. Explain about Magnetic Disk? A disk is ...

Q. Explain about Magnetic Disk? A disk is circular platter constructed of nonmagnetic material known as substrate, coated with a magnetisable material. This is used for storing

Emails, Compare and contrast POP e-mail to Web-based e-mail systems in term...

Compare and contrast POP e-mail to Web-based e-mail systems in terms of control, security, and accessibility.

Design a 32:1 multiplexer, Design a 32:1 multiplexer using two 16:1 multipl...

Design a 32:1 multiplexer using two 16:1 multiplexers and a 2:1 multiplexer Ans. Design a 32 X 1 MUX by using two 16 X 1 MUX and one 2 X 1. Now here total 32 input lines

What is boyce codd normal form, A relation schema R is in BCNF with respect...

A relation schema R is in BCNF with respect to a set F of functional dependencies if for all functional dependencies in F+ of the form a->b, where a and b is a subset of R, at leas

Ring, Ring This is a easy linear array where the end nodes are connecte...

Ring This is a easy linear array where the end nodes are connected.  It is equivalent to a engage with wrap around connections. The data transmit in a ring is normally one dire

What is glitch and what are causes of it, What is glitch? What causes this ...

What is glitch? What causes this (describe with waveform)? How to overcome this? The gated clock‘s corresponding timing diagram demonstrates that it implementation can lead to

What are the ways to truncate guard bits, What are the ways to truncate gua...

What are the ways to truncate guard bits? 1. Chopping 2. Von Neumann rounding 3. Rounding procedure.

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

Difference between search and search all, SEARCH is a sequential search fro...

SEARCH is a sequential search from the starting of the table. SEARCH ALL is a binary search, continually dividing the table in two halves until a match is found. SEARCH ALL is more

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