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

Explain typical network topologies, Question: a) Explain briefly three ...

Question: a) Explain briefly three typical network topologies giving one advantage and one disadvantage of each topology. Explain the three topologies with appropriate diagrams

Analysis of parallel algorithms, A generic algorithm is mostly analyzed on ...

A generic algorithm is mostly analyzed on the basis of the following parameters: the time complexity (implementation time) and the space complexity (amount of space necessary). Usu

Illustrate data-link layer in osi layers model, Q. Illustrate Data-Link Lay...

Q. Illustrate Data-Link Layer in osi layers model? Data-Link Layer: This layer takes the data messages or frames from the Network Layer and gives for their actual transmissio

Routing algorithms, compare routing algorithms with non adaptive algorithms...

compare routing algorithms with non adaptive algorithms

Explain ethernet addressing, Ethernet Addressing Every station on t...

Ethernet Addressing Every station on the network must have a unique physical address Offered by a six-byte physical address encoded on the network interface card (NIC)

Shared variable programme structures, Shared variable programme structures ...

Shared variable programme structures  In this section, we talk about some more concepts related to the shared programme. Concept of Lock Locks are used for protected a

Source to destination data transfer - datagram approach, Source to Destinat...

Source to Destination Data Transfer - Datagram approach - Each packet is treated independently. - Every pkt will take its own path to reach the destination. - There i

Building distributed systems, Unfortunately, building real-life distributed...

Unfortunately, building real-life distributed systems is not easy. It is hard, for instance, to implement instructions such as "send this data structure to be processed on that com

Timing in mpi program, MPI_Wtime ( ) returns elapsed wall-clock time in sec...

MPI_Wtime ( ) returns elapsed wall-clock time in seconds as some arbitrary point in past. Elapsed time for program segment is specified by the difference between MPI_Wtime values a

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