Potential of parallelism-parallel computing, Computer Engineering

Potential of Parallelism

Problems in the actual world differ in respect of the degree of natural parallelism inherent in the personal problem domain. Some problems may be simply parallelized. On the other hand, there are some natural sequential difficulty (for ex: - computation of Fibonacci sequence) whose parallelization is almost impossible. The extent of parallelism may be enhanced by appropriate design of an algorithm to explain the problem consideration. If processes don't split address space and we could remove data dependency among instructions, we can attain higher level of parallelism. The idea of speed up is used as a calculate of the speed up that point out up to what degree to which a sequential program can be parallelised.  Speed up may be occupied as a sort of point of inherent parallelism in a program. In this admiration, Amdahl has specified a law, known as Amdahl's Law, which declare that potential program speedup is distinct by the fraction of code (P) that preserve be parallelised:   

                                                                     2436_Potential of Parallelism.png

If no element of the code can be parallelized, P = 0 and the speedup = 1 i.e. it is an essentially sequential program. If every code is parallelized, P = 1, the speedup is infinite. But basically, the code in no program can made 100% parallel. Hence speed up can never be immeasurable.

If 50% of the code is parallelized, maximum speedup = 2, meaning the code will scamper twice as fast. If we establish the amount of processors performing the parallel fraction of work, the link can be modelled by:

                                                                    1442_Potential of Parallelism 1.png

Where P = parallel fraction, S = serial fraction and N = number of processors. The Table 1 shows the value of speed up for different values P and N.

                                                                        Table 1

                                                                                        Speedup

                                                       --------------------------------

                                                        N          P = .50 P = .90 P = .99

                                                      -----      -------   -------   -------

                                                        10          1.82     5.26     9.17

                                                        100        1.98     9.17     50.25

                                                        1000      1.99     9.91     90.99

                                                        10000    1.99     9.91     99.02

The Table 1 suggest that speed up increase as P increases. However, after a definite Limits N does not have a lot impact on the value of pace up. The reason being that, for N processors to remain dynamic, the code must be, in some way or other, being divisible in, independent part, roughly N parts each part taking almost same total of time.

Posted Date: 3/1/2013 4:29:04 AM | Location : United States







Related Discussions:- Potential of parallelism-parallel computing, Assignment Help, Ask Question on Potential of parallelism-parallel computing, Get Answer, Expert's Help, Potential of parallelism-parallel computing Discussions

Write discussion on Potential of parallelism-parallel computing
Your posts are moderated
Related Questions
No, You cannot apply the link and Association interchangeably. Since link is used show the relationship among the two objects. But Association is used signify the relationship

Layout view is helpful for laying out Web pages. However you can adjust most of your design elements in Layout view, certain changes should be completed in Standard view. When you

Q. Explain about PARAM Super computer? PARAM is a high-performance, industry standard and scalable computer. It has developed from concepts of distributes scalable computers ma

illustration of Z80 instruction set Computer

What is the necessity of Interfacing in digital ICs and what are the points to be kept in view, while interfacing between TTL gate and CMOS gate? Ans: To realize the optimum

What do you mean by E-cash? E-Cash and its Properties:  Ecash is cash which is represented by two models. One is the on-line form of e-cash which allows for the completi

What happens when HLT instruction is implemented in processor? Ans) The Micro Processor go into the Halt-State and the buses are tri-stated.

Q. Describe the Size and Speed of Scanners? Before actual scanning, a quick, low resolution scan known as pre-scan is made to preview the image and select scanning area. After

Q. Characteristics of Magnetic disk? Tracks and Sectors: Disk is divided in concentric rings known as tracks. Thus a track is one complete rotation of disk underneath read/wr

Ameliorating the mechanical delays of seeks and rottion are usually regardeed as major aspects of device drivers for disks. The simplest way for a disk device driver to service dis