Speed up with metrics for performance evaluation, Computer Networking

Assignment Help:

Speed Up:-

Speed up is the ratio of the time required to implement a given program using a definite algorithm on a machine with one processor (i.e. T (1) (where n=1)) to the time required Advanced Topics to implement the similar program using a specific algorithm on a machine with multiple processors (i.e. T(n)). Basically the speed up factor helps us in knowing the relative gain achieved in shifting from a sequential machine to a parallel computer. It may be noted that the term T(1) signifies the amount of time taken to implement a program using the best sequential algorithm i.e., the algorithm by least time complexity  

S(n)  =  T(1) T(n).

Let us take an example and illustrate the practical use of speedup. Assume, we have a problem of multiplying of n numbers. The time complexity of the sequential algorithm for a machine with one processor is O (n) as we require one loop for reading as well as computing the output. Though, in the parallel computer, let each number be allocated to individual processor and computation model being used being a hypercube. In such a Condition, the total number of steps needs to compute the result is log n i.e. the time complexity is O(log n). Figure, illustrates the steps to be followed for achieving the desired output in a parallel hypercube computer model.

257_Steps followed for multiplying n numbers stored on n processors.png

                  Steps followed for multiplying n numbers stored on n processors

As the number of steps followed is equal to 3 i.e., log 8 where n is number of processors. Therefore, the complexity is O(log n).

In view of the fact that sequential algorithm takes 8 steps and the above-mentioned parallel algorithm takes 3 steps, the speed up is as beneath:

                                        S (n) = 8/3

As the value of S(n) is inversely proportional to the time necessary to compute the output on a parallel number which in turn is dependent on number of processors employed for performing the computation. The relation among S (n) vs. Number of processors is shown in Figure. The speeadup is directly proportional to number of processors, thus a linear arc is depicted. Though, in situations where there is parallel overhead, the arc is sub-linear.

1354_Speed-up vs. Number of Processors.png

 Speed-up vs. Number of Processors


Related Discussions:- Speed up with metrics for performance evaluation

Operating system for server, Operating system for Server Since 1994, w...

Operating system for Server Since 1994, when the original pair of web servers - NCSA HTTPd and CERN HTTPd , were proposed, dozens of commercial and shareware programs have

Show the ip address representation, Q. Show the IP Address Representation? ...

Q. Show the IP Address Representation? IP Addressing IP Address Representation Binary notation - IP address is displayed as 32 bits Dotted-decimal notation -

Encrypted with a symmetric key, Alice sends a message to Bob, encrypted wit...

Alice sends a message to Bob, encrypted with a symmetric key. Bob decrypts the message and finds it is a purchase order for an expensive workstation. When the time comes to deliver

For making assignment, can you make the assignment plagiarism free and when...

can you make the assignment plagiarism free and when you give me back the assignment. Thanks

Show example on hedge fund, Q. Show example on Hedge Fund? Hedge Fund ...

Q. Show example on Hedge Fund? Hedge Fund have been playing a no-lose game In the easiest strategy a hedge fund borrows Hong Kong dollars (HKD) and then sells them in the

What is the virtual path, Along any transmission path from a given source t...

Along any transmission path from a given source to a given destination, a group of virtual circuits can be grouped together into what is known as path.

command saves the configuration stored in ram to nvram, Which command save...

Which command saves the configuration stored in RAM to NVRAM Ans) copy running-config startup-config is the command which saves the configuration stored in RAM to NVRAM

Shortest path - network layer and routing , Shortest path  The  dijkst...

Shortest path  The  dijkstra algorithms  four steps to discover what it called  the shortest path  tree . a.The algorithm  beings  to build  the tree identifying  its root.

asymmetric multiprocessing, Describe what is meant by Asymmetric Multiproc...

Describe what is meant by Asymmetric Multiprocessing (AMP)? Ans) It imposses hierarchy and a division of labour between processors. Only one designated processor, the master, co

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