Introduction to performance evaluations, Computer Networking

INTRODUCTION

In this part, the topic of performance evaluation shows those parameters that are devised to calculate the performances of various parallel systems. Achieving the highest possible performance has always been one of the major goals of parallel computing. Unfortunately, most often the real performance is less by a factor of 10 and even bad as compared to the designed peak performance. This creates parallel performance evaluation an area of priority in high-performance parallel computing. As we already know, sequential algorithms are mostly analyzed on the basis of computing time i.e., time complexity and this is directly related to the data input size of the trouble. For example, for the trouble of sorting n numbers using bubble sort, the time complexity is of O (n2). Though, the performance analysis of any parallel algorithm is dependent upon three main factors viz. time complexity, total number of processors required and total cost. The complexity is normally related with input data size (n).

Therefore, unlike performance of a sequential algorithm, the evaluation of a parallel algorithm can't be carried out without considering the other vital parameters like the total number of processors being employed in a definite parallel computational model. Thus, the evaluation of performance in parallel computing is depend on the parallel computer system and is also dependent upon machine configuration like PRAM, combinational circuit, interconnection network configuration etc. in addition to the parallel algorithms used for a variety of numerical as well non-numerical problems.

This unit gives a platform for understanding the performance evaluation methodology as well as giving an overview of some of the famous performance analysis techniques.

 

Posted Date: 3/4/2013 5:46:29 AM | Location : United States







Related Discussions:- Introduction to performance evaluations, Assignment Help, Ask Question on Introduction to performance evaluations, Get Answer, Expert's Help, Introduction to performance evaluations Discussions

Write discussion on Introduction to performance evaluations
Your posts are moderated
Related Questions

Throughput is a calculate of the rate at which data can be transmit through the network. The throughput capability of the underlying hardware is known bandwidth. Because every fram

802.11 DSSS a) Direct sequence spread spectrum in a 2.4 GHz band b) Each bit is replaced by a sequence of bits called a chip code, implemented at the physical layer c) Se

Q. Explain about Star Backbone network? - Collapsed or switched backbone - Backbone is just one switch that connects LANs - Utilized as distribution backbone inside a bui

Ping and Traceroute are used by ICMP for Testing. Destination Unreachable messages are obtained by a router when it does not have a route to the network.


In this question, you will compare delays in packet switching (i.e. in IP networks), in circuit switching (i.e. in PSTN telephony) and in virtual circuit packet switching (i.e. in

What is ipconfig? Ipconfig is a utility program that is commonly used to recognize the addresses information of a computer on a network. It can show the physical address as wel

What is routing region? When hierarchical routing is used, the routers are separated into what we call regions, with each router knowing all the details about how to route pack

Q. Example on TCP numbering? Envision a TCP connection is transferring a file of 6000 bytes. The first byte is numbered 10010. What are the sequence numbers for every seg