Metrics for performance evaluation, Computer Networking

Assignment Help:

Metrics For Performance Evaluation

In this section, we would highlight different kinds of metrics involved for analyzing the performance of parallel algorithms for parallel computers.

Running Time

The running time is the amount of time consumed in implementation of an algorithm for a given input on the N-processor based parallel computer. The running time is indicated by T(n) where n shows the number of processors employed. If the value of n is equal to 1, then the case is same to a sequential computer. The relation among Execution time vs. Number of processors is shown in Figure 1.

804_Execution Time vs. number of processors.png

                                                                 Execution Time vs. number of processors

It can be simply seen from the graph that as the number of processors increases, firstly the implementation time reduces but after a certain optimum level the implementation time increases as number of processors increases. This inconsistency is because of the overheads involved in increasing the number of processes.


Related Discussions:- Metrics for performance evaluation

What does the user datagram protocol (udp) , UDP is connectionless, and doe...

UDP is connectionless, and does not give error checking. But remember, error checking can happen at other layers too.

What are the brigdes, Brigdes Introduction - LAN may require to cove...

Brigdes Introduction - LAN may require to cover more distance than the media can handle effectively or - Number of stations may perhaps be too great for efficient frame d

Describe physical layer in osi layers model, Q. Describe Physical Layer in ...

Q. Describe Physical Layer in OSI layers model? Physical Layer : Controls the transmission of the actual data onto the network. It describes the electrical signals, line state

What is the network time protocol, What is the Network Time Protocol? ...

What is the Network Time Protocol? A protocol that makes sures accurate local timekeeping with reference to radio and atomic clocks located on the Internet. This protocol is c

Distribution system from bss, To Distribution System from BSS We requir...

To Distribution System from BSS We require to identify the AP as the first hop to the destination (B) A will receive an ACK from the AP - indicates frame successfully on

Routing by rumor, What is the major issue with routing by rumor?

What is the major issue with routing by rumor?

Difference between a straight-through and crossover cable, What is the diff...

What is the difference between a straight-through and crossover cable? A straight-through cable is used to connect computers to a hub, switch, or router. A crossover cable is u

Filtering incoming frames, FILTERING INCOMING FRAMES: An analyzer may ...

FILTERING INCOMING FRAMES: An analyzer may be configured to process and filter frames. It may count frames of a specific size or type. It may also shows only frames from or to

Determine the window positions for succession of events, Two neighbouring n...

Two neighbouring nodes (A and B) use a Go-Back-N protocol with a 3-bit sequence number and a window size of 4. Acknowledgments are cumulative. Assuming A is transmitting and B is r

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