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

What is a lan, What is a LAN? LAN stands for Local Area Network. It ref...

What is a LAN? LAN stands for Local Area Network. It refers to the connection among computers and other network devices that are located within a small physical location.

What is load balancing, If the number of incoming clients invokes exceeds t...

If the number of incoming clients invokes exceeds the number of processes in a server class, the TP Monitor might be dynamically start new ones and this is known as Load balancing.

What is subnet mask, What is subnet mask? A subnet mask is combined wit...

What is subnet mask? A subnet mask is combined with an IP address in order to recognize two parts: the extended network address and the host address. Such as an IP address, a s

Implication of increasing and decreasing subnet bits, What is the suggestio...

What is the suggestion of increasing and decreasing subnet Bits?

Define ike modes, Normal 0 false false false EN-IN X-...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

What to do to connection with external communication, What to do to connect...

What to do to connection with external communication For dealing with external communication, the Web server must have a static IP. Having a static IP could also be a problemat

Data mining, The following DNA sequences are extracted from promoter region...

The following DNA sequences are extracted from promoter region of genes which are co-regulated by the same transcription factor (TF). The nucleotide segments capitalized in the giv

Computing shortest path in a graph, While calculating shortest path, first ...

While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other on

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