Efficiency vs. number of processors, Computer Networking

Assignment Help:

Efficiency:-

The other main metric used for performance measurement is efficiency of parallel computer system i.e. how the resources of the parallel systems are being utilized. This is known as degree of effectiveness and the efficiency of a program on a parallel computer with k processors can be defined as the ratio of the relative speed up achieved as shifting the load from one processor machine to k processor machine where the multiple processors are being used for achieving the result in a parallel computer. This is denoted by E(k).

Ek is defined as follows:

E(k) = S (k )/ k

The value of E (k) is directly proportional to S (k) and inversely proportional to number of processors employed for performing the computation. The relation between E (k) vs. Number of processors is shown in Figure.

1947_Efficiency vs. Number of Processors.png

   Efficiency vs. Number of Processors

Assuming we have the multiplication problem as discussed above with k processors, then the efficiency is as under:

E(k) = T(1)/T(n)*K = N/log n*N

E(n) =1/log(n)

Now, supposing we have X processors i.e. X < K and we have to multiply n numbers, in such a condition the processors may be overloaded or might have a few overheads. Then the efficiency is as under:

E(X)= T(1)/T(X)*X

Now, the value of T(X) has to be computed. As we have n numbers, and we have X processors, thus firstly each processor will multiply n/X numbers and consequently process the X partial results on the X processors according to the method discussed in Figure. The time complexity is equal to the sum of the time to compute multiplication of k/X numbers on every processor i.e., O(k/X) and time to compute the answer of partial results i.e. log (X)

E(X) =K/(K/X +log(X))*X

E(X) = (K/X)/(K/X +log(X))

Dividing by X/K we get

E(X) = 1/ (1+(X/K)* log(X))

It can be concluded from the above statement that if N is fixed then the efficiency i.e. E(X) will reduces as the value of X increases and becomes equivalent to E(N) in case X=N.  Likewise, if X is fixed then the efficiency i.e., E(X) will increase as the value of X i.e. the number of computations increases.

The other performance metrics engage the standard metrics like MIPS and Mflops. The term MIPS (Million of Instructions Per Second) shows the instruction execution rate. Mflops (Million of Floating Point Operations per Second) shows the floating-point execution rate.


Related Discussions:- Efficiency vs. number of processors

What are ip addresses, What are IP addresses? IP address refers to the ...

What are IP addresses? IP address refers to the name of a computer on a network, like the Internet. An Identifier for a computer or device on a TCP/IP network, like the

Security mechanism, How can the use of NAT and PAT, be considered a securit...

How can the use of NAT and PAT, be considered a security mechanism? Research the acronym(s) if it is not a part of your collection.

What is difference among arp and rarp, What is difference among ARP and RAR...

What is difference among ARP and RARP? The address resolution protocol (ARP) is used to associate the 32 bit IP address with the 48 bit physical address, used by a host or a ro

Network, network diagram which must include at least 2router,2bridge and 4 ...

network diagram which must include at least 2router,2bridge and 4 switches and must have different protocols and different cable...?

Difference between routable and non- routable protocols, What is the differ...

What is the difference between routable and non- routable protocols? Routable protocols can work with a router and can be used to make huge networks. Non-Routable protocols

Why mac address called physical address, MAC address called Physical addres...

MAC address called Physical address Because it's not changeable

Multicast extension to ospf, MOSPF MOSPF is multicast extension to OSP...

MOSPF MOSPF is multicast extension to OSPF. This protocol is extension of OSPF which is a unicast routing protocol which make MOSPF a combination of unicast and multicast prot

What is bit stuffing, What is Bit Stuffing? Bit stuffing is the process...

What is Bit Stuffing? Bit stuffing is the process of adding one extra 0 whenever five consecutive is follow a 0 in the data, so that the receiver does not mistake the pattern 0

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