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
Q. TCP – numbering bytes? Numbering is utilized for flow & error control Segments aren't numbered only bytes Full-duplex connection - numbering is independent in

Firewalls After several  security  related internet  newsgroups  started overflowing  with posts it becomes  clear something  hand to done to help  secure  networks. The first

Hosts are generally, individual machines at a specific location. Normally Resources of host machine are shared and can be used by any user on Internet. Hosts & local networks are g


Application Layer The  application layer is where  network  applications and their  application layer protocols  reside. The internet application layer includes many protocols

Error Detection- Check Sum The Checksum generator are subdivides the data unit into equal segments of "n" bits (usually 16) These segments are added utilizing one's c

Source quench is the process where the destination router, or end internetworking device will "quench" the date from the "source", or the source router. This usually occurs when th

What do you mean by platform independence? Platform independence means that we can write and compile the java code in one platform (eg Windows) and can implement the class in a

Assume that the clock-driven scheme for generating starting sequence numbers is used with a 16-bit wide clock counter (that is, sequence numbers range from 0 to 2^16).  The clock t

Explain everything you can tell from the following: a. 00-01-00-01-13-FD-F4-C0-00-1E-33-92-CE-99 b. fe80::2c1e:18af:749b:91c5%12 c. 2002:8b64:6e3a::8b64:6e3a d. ::0