Speed up with metrics for performance evaluation, Computer Networking

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

Posted Date: 3/4/2013 5:54:52 AM | Location : United States







Related Discussions:- Speed up with metrics for performance evaluation, Assignment Help, Ask Question on Speed up with metrics for performance evaluation, Get Answer, Expert's Help, Speed up with metrics for performance evaluation Discussions

Write discussion on Speed up with metrics for performance evaluation
Your posts are moderated
Related Questions
Computer Networks 1. Differentiate WAN and LAN. 2. Describe the TCP/IP Reference Model with diagram. 3. Explain Circuit switching and message switching. 4. List the fu

Which layers are network support layers? a. Physical Layer b. Data link Layer and c. Network Layers

Illustrate a traffic light is an example of what type of mechanism Ans) A Traffic light is an example of flow control.

Question 1 Define client and server. Explain the Client server model Question 2 What is a Mainframe System? Write down the features of Mainframe System Question 3

Describe Network Topology and VPN Network Topology refers to the layout of a computer network. It presents how devices and cables are physically laid out, as well as how they j

What do you mean by Protocol? In the context of data networking, a protocol is a formal set of rules and conventions that governs how computers exchange information over a netw


Packet Switching In the  packet  switching network  type on specific  path is  used for  data  transfer. Instead the data is chopped up into  small  pieces called packed and s


Determine about unique least-cost path If there is a unique least-cost path, the two algorithms will yield the similar result because they are both guaranteed to search the lea