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

Give difference between assembler and interpreter, Give difference between ...

Give difference between assembler and interpreter. Assembler: It is the translator for an assembly language of computer. An assembly language is a low-level programming langu

Define the term intranet, Define the term Intranet. Intranet: An...

Define the term Intranet. Intranet: An Intranet is a type of information system that facilitates communication within the organizations among widely dispersed department

Odd-even merging circuit, Odd-Even Merging Circuit Let's firstly unders...

Odd-Even Merging Circuit Let's firstly understand the idea of merging two sorted sequences using an odd-even merging circuit. The functioning of a merging circuit is as given b

Give an example of resource allocation graph & deadlocked, Suppose there ar...

Suppose there are 2 copies of resource A, 3 copies of resource B, and 3 copies of resource C. Suppose further that process 1 holds one unit of resources B and C and is waiting for

Can we run matlab without graphics, Sometimes you may need to run scripts w...

Sometimes you may need to run scripts which have plotting commands without displaying the plots and without going into the script to comment out the commands. An example: if you're

What is digital versatile disk read only memory, DVD-ROM employs same princ...

DVD-ROM employs same principle as a CD-ROM for reading and writing. However a smaller wavelength laser beam is used. Total capacity of DVD-ROM is 8.5GB. In double-sided DVD-ROM two

recycling from e-waste to resources , Make at least 6 web pages with good ...

Make at least 6 web pages with good formatting, color balance and presentation on any one of the following topics:- 1.    Recycling from E-waste to resources 2.    Light and So

Illustrate the multiplication algorithms, Multiplication Algorithms Mul...

Multiplication Algorithms Multiplication of the two fixed-point binary numbers in signed magnitude representation is done with paper and pencil through a process of successive

Explain crossbar exchange with all call processing steps, Explain crossbar ...

Explain crossbar exchange, with all call processing steps and diagrams. The fundamental idea of crossbar switching is to give a matrix of n x m sets of contacts with only n + m

How do you control instructions like branch, How do you control instruction...

How do you control instructions like branch, cause problems in a pipelined processor? Pipelined processor gives the best throughput for sequenced line instruction. In branch in

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