Explain potential of parallelism, Computer Engineering

Potential of Parallelism

Problems in the actual world differ in respect of the amount of inherent parallelism intrinsic in respective problem domain. Some problems can be easily parallelized. Conversely, there are some inherent chronological problems (e.g. computation of Fibonacci sequence) whose parallelization is almost impossible. The extent of parallelism can be enhanced by suitable design of an algorithm to solve the problem consideration. If processes do not share address space and we could get rid of data dependency among instructions, we can attain higher level of parallelism. The idea of speed up is used as a measure of the speed up which indicates up to what extent to which a sequential program can be parallelized.  Speed up can be taken as a sort of amount of inherent parallelism in a program. In that respect, Amdahl has given a law, called Amdahl's Law, according to this law potential program speedup is stated by the fraction of code (P) which can be parallelised:

Speed up= 1 / 1-p

If no part of the code can be parallelized, P = 0 and speedup = 1 it implies that it is an inherently chronological program. If all the code is parallelized then P = 1, the speedup is infinite. However practically, the code in no program is able to make 100% parallel. Therefore speed up cannot be infinite ever.

If 50% of code can be parallelized, maximum speedup = 2, meaning the code would run twice as fast.  

If we set up the number of processors executing the parallel fraction of work, the relationship can be modeled by:

2485_Potential of Parallelism.png

Where P = parallel fraction, N = total number of processors and S = Serial fraction.The Table 1 shows the values of speed up for various values N and P.

1889_Potential of Parallelism 1.png

The Table 1 proposes that speed up increases as P increases. Though, after a certain limits N doesn't have much impact on the value of speed up. The reason being that is for N processors to remain active, the code must be in some way or other, be divisible in more or less N parts, independent part, every part taking almost equal amount of time.

Posted Date: 7/9/2013 7:16:40 AM | Location : United States







Related Discussions:- Explain potential of parallelism, Assignment Help, Ask Question on Explain potential of parallelism, Get Answer, Expert's Help, Explain potential of parallelism Discussions

Write discussion on Explain potential of parallelism
Your posts are moderated
Related Questions
In the module on WSDL you were presented with the details of the WSDL service that receives a request for a stock market quote and returns the quote. The basic structure of a WSDL

DVD is a new technology very same to compact discs. A DVD looks just like an ordinary compact disc, though a DVD can hold up to 25 times as much as a CD!! That's 18 gigabytes!! Thi

Jobs which are admitted to the system for processing is called ? Ans. Long-term scheduling is admitted to the system for processing.

Q. What is Building and Running MPI Programs? MPI parallel programs are written using conventional languages such as FORTRAN and C. One or more header files like 'mpi.h' may be

Q. Design a half adder? In half adder inputs are: The augend let's say 'x' and addend 'y' bits. The outputs are sum 'S' and carry 'C' bits. Logical relationship betwee

When can a user program execution be interrupted? It won't be desirable to interrupt a program when an instruction is being executed and is in a state such as instruction decod

haw to convert context free grammar to regular grammar

Define parity bit and List its types. The most common error detection code used is the parity bit. Parity bit is a extra bit contained with a binary message to make the total n

I NEED THE CODES IN MATLAB FOR RESOURCE ALLOCATION IN GRID COMPUTING

Define the Character Set of C Language? C uses the lower case letter a to z, the upper case letters A to Z, the digits 0 to 9 and certain characters as building blocks to form