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
NETWORK OWNERSHIP:   There are two types in this case: 1. Private Network 2. Public Network


Q. Describe Differential Manchester? - Inversion at middle of bit interval is utilized for synchronization - Presence or else absence of additional transition at beginning o

1.  Consider these two potential additions to the MIPS instruction set and explain how they would restrict pipelining. a)  cp d1(r1), d2(r2) copy contents of word at address

What is a Counter A software code that indicates how many times a site has been visited. It gets automatically updated and is usually represented by a small rectangle with n

QUESTION a) The aim of a computer network is to increase efficiency and reduce costs. Explain how networks of computers achieve the above. b) Describe the star topology. Su

Explain Persistence timer? To deal with the zero-size windows What if a receiver advertises that the window size is 0 (by sending ACK) and this ACK is lost? - A

Store-and-forward switch  The layer 2 switch accepts a frame on an input line, buffers it briefly, and then routes it to the appropriate output line. Cut-through switch

Primary Function Core network typically providing  the followings functionality 1.Aggregation : the  highest  level  of aggregation  in a service  provider  networks. The

What are the Advantages of adaptive routing  (1) An adaptive routing method can improve performance, as realised by the network user. (2) An adaptive routing method can aid