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

Merits of message passage-shared memory, Gives excellent low-level control ...

Gives excellent low-level control of parallelism; Portable; Minimal overhead in data distribution and parallel synchronisation; and It is less error prone. Drawb

Categories of address forms, Categories of address forms: STATIC: ...

Categories of address forms: STATIC:  In this type the hardware manufacturer gives permanent physical address to every network manufacturer and interface must ensure th

What are called transactions, The grouped SQL statements are known as Trans...

The grouped SQL statements are known as Transactions (or) A transaction is a collection of actions embused with ACID properties.

Signaling, The term signaling is used to define communication about the net...

The term signaling is used to define communication about the network, as opposed to interaction that just uses the network. A computer uses signaling with reserved VCI/VPI numbe

Name the strategies devised by ietf, Question: a) Show the shortest for...

Question: a) Show the shortest form of the following IPv6 address: 2340:0000:0000:000F:7000:119A:A001:0000 b) The IPv6 header includes a Class field and a Flow ID field. Bri

How two adjacent layers communicate in a layered network, How two adjacent ...

How two adjacent layers communicate in a layered network? (or What do you mean by Service Access Point?) In layered network, each layer has lots of entities and entities of lay

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)

Distance-vector routing, Local information is immediate hop routing table a...

Local information is immediate hop routing table and distance from every switch. The switches regularly broadcast topology information i.e. distance, destination. Other switches mo

Routing principle - network layer and routing , Routing Principle The p...

Routing Principle The principle  criterion of  successful routing is of course correctness but it not only criterion. You might  prefer to take the most direct route ( the  one

Determine how many bits are used for the page number, 1.  A virtual memory ...

1.  A virtual memory system has a virtual address space of 4 Gigabytes and a page size of 8 Kilobytes.  Each page table entry occupies 4 bytes.   a)  How many bits remain unchanged

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