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
Explain the concept of router-root path The mean router-router path is double the mean router-root path. Number levels of tree with root as 1 and the deepest level as n. The pa

modern technology in world of 21 century

Explain about the Browser A program that allows the user to access and read information on the World Wide Web. Netscape® Navigator and Microsoft Explorer® are the best known

Reference models Designing  implementing and  manufacturing  computer  networks  and related  devices  are very  complex  activities. Therefore in order  for this  technolog

Give me a wide idea about simple pendulum and its types with equation and tables as usual assignment?

The client side building block moves towards the client side of the application. The server side building block moves towards the server side of the application.

UNIX For Multiprocessor System:- The UNIX operating system for a multiprocessor system has a number of additional features as compared to the normal UNIX operating system.  Let

What is Security solutions Though there are a number of security solutions available due to sophistication in technology, there are a number of risks and difficulties attached

Path Layer The path  layer maps services  such as DS3, FDDI, and ATM into the SONET  payload formal. This layer  provides  end to end  communications  signals  labelling path m

Example Programmes for Parallel Systems Now we shall complete this with the examples on shared memory programming. Example 13: Adding elements of an array using two proce