Amdahls law - calculate speed up performance, Computer Engineering

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

Posted Date: 3/5/2013 4:43:39 AM | Location : United States







Related Discussions:- Amdahls law - calculate speed up performance, Assignment Help, Ask Question on Amdahls law - calculate speed up performance, Get Answer, Expert's Help, Amdahls law - calculate speed up performance Discussions

Write discussion on Amdahls law - calculate speed up performance
Your posts are moderated
Related Questions
Q. Define a Formal System? A Formal System is one which is planned in advance and is used according to schedule. In this system procedures and policies are documented well in a

What is linear bounded automation?   A linear bounded automation is restricted type of Turing machine where in the tape head isn't permitted to move off the portion of the tape

Design two matlab algorithms for enlarging the 256x256 images into 512x512 images by using bilinear and bicubic interpolations   a)  Evaluate the interpolated images with the

Minimize the following logic function using K-maps and realize using NAND and NOR gates. F(A,B,C,D) =?_m(1,3,5,8,9,11,15) + d(2,13).

Variable ordering - Forward checking: Hence this is different from variable ordering in two important ways as:  Whether this is a dead end when we will end up visiting a

The number of control lines for 16 to 1 multiplexer is ? Ans. We have 16 = 2 4 , 4 Select lines are needed.

Data buffering is quite helpful for purpose of smoothing out gaps in speed of processor and I/O devices. Data buffers are registers that hold I/O information temporarily. I/O is pe

Question: (a) Explain clearly the difference between a Proposal and a Treatment for a video production project. (b) Explain clearly the difference between Narrative form an


Describe the necessary conditions for Deadlock. Required conditions for deadlock 1. Mutual exclusion 2. Hold and wait 3. No preemption 4. Circular wait Mutual e