Introduction to performance evaluations, Computer Networking

Assignment Help:

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.

 


Related Discussions:- Introduction to performance evaluations

Arrays pointers for parallel algorithms, Arrays Pointers An array is a ...

Arrays Pointers An array is a set of the same type of data. Arrays are very well-liked data structures in parallel programming due to their easiness of use and declaration. At

Programs for implement tools for digital sound, You must write the 6 progra...

You must write the 6 programs described below. All of these are command-line tools that follow the Unix style of passing switches and arguments on the command line. As such, your p

What are the two broad class classifications, What are the two broad class ...

What are the two broad class classifications under which Networks can be divided? All computer networks fit in one of the two dimensions namely: a)      Transmission Technol

Computer Networking help, Hello, I have a question which is due tomorrow (2...

Hello, I have a question which is due tomorrow (2/15/2013) at 11:55pm. The configuration portion of the exercise has been completed. I only need the questions in bold answered (onl

Define character stuffing, Define Character Stuffing? In byte stuffing ...

Define Character Stuffing? In byte stuffing (or character stuffing), a particular byte is added to the data section of the frame when there is a character with the same pattern

What is load balancing, If the number of incoming clients invokes exceeds t...

If the number of incoming clients invokes exceeds the number of processes in a server class, the TP Monitor might be dynamically start new ones and this is known as Load balancing.

What is a database server, With a database server, the client gives SQL req...

With a database server, the client gives SQL requests as messages to the database server. The results of every SQL command are returned over the network. The server uses its own pr

Describe about cryptography, Q. Describe about Cryptography? - Some med...

Q. Describe about Cryptography? - Some media cannot be protected from unauthorized reception (or interception) - Encryption involves transforming the original information in

Show the error detection- check sum, Error Detection- Check Sum Th...

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

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