Amdahl law to measure speed up performance, Computer Engineering

Assignment Help:

Q. Amdahl Law to measure speed up performance?

Remember that speed up factor assists us in knowing relative gain attained in shifting execution of a task from sequential computer to parallel computer and performance doesn't increase linearly with rise in number of processors. Because of above reason of saturation in 1967 Amdahl's law was derived. Amdahl's law defines that a program includes 2 types of operations that is complete sequential operations that should be done serially and complete parallel operations that can be executed on numerous processors. The declaration of Amdahl's law can be illustrated with help of following example. 

Let's discuss a problem say P that has to be solved with the help of parallel computer. In accordance with Amdahl's law there are principally two types of operations. So the problem would have a number of serial operations and a number of parallel operations. We already know that this requires T (1) amount of time to carry out a problem using a sequential machine and sequential algorithm. The time to calculate sequential operation is a fraction α (alpha) (α ≤ 1) of total execution time that is T (1) and time to calculate parallel operations is (1- α). So S (N) can be calculated as below:

100_Amdahl Law to measure speed up performance.png

Dividing by T(1)

1768_Amdahl Law to measure speed up performance1.png

Consider the value of α is amid 0 and 1. Now let's put a number of values of α and calculate speed up factor for rising values of number of processors.  We find that S(N) continue reduces with increase in value of α (which is number of serial operations as displayed in Figure below). 

1461_Amdahl Law to measure speed up performance2.png

Figure: Speed-up vs. Number of Processors

The graph in Figure clearly demonstrates that there is a bottleneck caused because of serial operations in parallel computer. Even when numbers of serial operations are more after rising number of processors speed up factor S (N) degrades. 

The sequential fraction which is α can be compared with speed up factor S (N) for a permanent value of N let's say 500. Figure below demonstrates a pictorial view of effect of Amdahl's law on speed up factor.

1241_Amdahl Law to measure speed up performance3.png

Figure: (n) vs. α (Graph is not to scale)


Related Discussions:- Amdahl law to measure speed up performance

Highly encoded micro-instructions, Highly Encoded micro-instructions ...

Highly Encoded micro-instructions Encoded bits required in micro-instructions are small. It provided an aggregated view that is a higher view of CPU as just an encoded

Explain about integration levels, Q. Explain about Integration Levels? ...

Q. Explain about Integration Levels? Initially only few gates were integrated consistently on a chip. This initial integration was termed as small-scale integration (SSI). With

Example of a router connects to at most networks, A router connects to at m...

A router connects to at most K networks. How many routers R are required to connect to N networks? Derive an equation that gives R in terms of N and K. If N K and K >=2 this

Define interrupts, Interrupts are signals which cause the CPU to suspend th...

Interrupts are signals which cause the CPU to suspend the currently executing program and transfer to a special program known as an interrupt handler. Interrupt handler determines

What is hamiltonian path, What is Hamiltonian path?  A Hamiltonian path...

What is Hamiltonian path?  A Hamiltonian path in a directed graph G is a directed path that goes through every node exactly once. We consider a special case of this problem whe

Explain implementation of circuits from boolean expression, Explain Impleme...

Explain Implementation of the Circuits From the Boolean Expression? If the operation of the circuit is defined by a Boolean expression, a logic-circuit diagram can he implement

Explain isdn addressing with a example, Explain ISDN Addressing with a exam...

Explain ISDN Addressing with a example. A sub address, though a part of the ISDN address, is not seems as an integral part of the numbering scheme. Sub-address is carried in a

What is algorithm design technique, What is Algorithm Design Technique? ...

What is Algorithm Design Technique? An  algorithm  design  method  is  a  general  approach  to  solving  problems  algorithmically  that  is applicable to a variety of proble

What is microprocessor, Microprocessor is a program-controlled device, whic...

Microprocessor is a program-controlled device, which fetches the instructions from memory, decodes and implements the instructions. Most Micro Processor is single- chip devices.

Input output techniques - computer architecture, Input Output Techniques: ...

Input Output Techniques: o   Interrupt driven o   Direct Memory Access (DMA) o   Programmed Programmed I/O   CPU has control over I/O directly   Read/write

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