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

Sequence number - transport layer, Sequence Number After  the bytes...

Sequence Number After  the bytes have been numbered TCP assigns a sequence number to each segment   that is  being sent. These sequence number for each segment  is the numb

Explain the meaning of disassociation, Explain the meaning of Disassociatio...

Explain the meaning of Disassociation A notification from either a station or an AP that an existing association is terminated. A station should provide this notification befor

Low frequency cut-off of the band-pass, Question Approximately what is ...

Question Approximately what is the low frequency cut-off of the band-pass filter shown in the figure?

Was the entire transaction completed, The following information was obtaine...

The following information was obtained from a host computer: 00:05:17.176507 74.125.228.54.1270 > 64.254.128.66.25: S 2688560409:2688560409(0) win 16384 (DF) (ttl 46, id 2096

Hub - network layer and routing , Hub A hub  is a  small box that  con...

Hub A hub  is a  small box that  connects  individual devices on network  so that  these devices  can  communicate  with each  other. Hub  is an inexpensive device. It is comm

Synchronization in factor causing , Synchronization Multiple processors...

Synchronization Multiple processors need synchronization with each other while implementing a parallel algorithm. That is, the task running on processor X might have to wait fo

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.

Explain a transaction server, With a transaction server, the client request...

With a transaction server, the client requests remote procedures that reside on the server with an SQL database engine. These remote processes on the server execute a group of SQL

Comparison of distance-vector and link-state algorithm, DISTANCE-VECTOR ROU...

DISTANCE-VECTOR ROUTING: It is easy to implement. Packet switch modifies its own routing table first. It is used in RIP. LINK-STATE ALGORITHM: It is ve

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