Potential of parallelism-parallel computing, Computer Engineering

Assignment Help:

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.


Related Discussions:- Potential of parallelism-parallel computing

How society is affected thorugh internet, How society is affected thorugh I...

How society is affected thorugh Internet Buying goods and services (for example banking) over the internet has both negative and positive aspects on society. These can be expl

Combinatorial and scheduling problems, Combinatorial and Scheduling Proble...

Combinatorial and Scheduling Problems: One class of problems is concerned with specifying optimal scheduled. A classical example is the Travelling Salesperson Problem where

What do you mean by software poll, Q. What do you mean by Software Poll? ...

Q. What do you mean by Software Poll? In this scheme on occurrence of an interrupt, processor jumps to an interrupt service program or routine whose job is to poll (roll call

Pvm communication model, Q. PVM communication model? A nonblocking rece...

Q. PVM communication model? A nonblocking receive as soon as returns with either data or a flag that data hasn't arrived while a blocking receive returns only when data is in r

Explain the differences between paging and segmentation, Explain the differ...

Explain the differences between Paging and segmentation. Paging and segmentation P aging Segmentation Computer memory is separa

Explain the term- cycle based simulator, Explain the term- Cycle Based Simu...

Explain the term- Cycle Based Simulator This is a Digital Logic Simulation method which eliminates unnecessary calculations to achieve huge performance gains in verifying Bool

Explain the working of a two input EX-OR gate, With relevant logic diagram ...

With relevant logic diagram and truth table explain the working of a two input EX-OR gate. Ans. 2-Input EX-OR Gate: An EX-OR or Exclusive gate recognizes words that have an od

What is magento, Magento is a feature-rich eCommerce platform built on open...

Magento is a feature-rich eCommerce platform built on open-source technology that gives online merchants with unprecedented flexibility and control over the look, content and funct

Low on the data-input line, For the 8-bit bidirectional register in Figure ...

For the 8-bit bidirectional register in Figure 3, verify the status of the register after every clock pulse for the LEFT RIGHT /control waveform given. A HIGH on this input permits

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