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

Error detection-redundancy, Q. Error Detection-Redundancy? In its p...

Q. Error Detection-Redundancy? In its place of repeating the entire data stream a shorter group of bits may be appended to the end of each unit. Called as -redundancy?

Broadcast and multicast , Broadcast and Multicast : Broadcast and Mult...

Broadcast and Multicast : Broadcast and Multicast :In the broadcast interconnection network, at one time one node transfer the data and all other nodes get that data.  Broadca

Working of TCP - buffers, Q. Working of  TCP - buffers? TCP - buffers ...

Q. Working of  TCP - buffers? TCP - buffers Sending & receiving buffers - Processes don't consume data at the same speed Sending site: - White section: unfilled

What is sonet sts, SONET STS SONET defines a hierarchy of signalling le...

SONET STS SONET defines a hierarchy of signalling levels called as STSs (Synchronous Transport Signals). Every STS level supports a certain data rate specified in megabits p

Define the term - frame and packets, Define the term - frame and packets ...

Define the term - frame and packets Frames sum up packets. When a packet arrives at data link layer, the complete packet, header, data and remaining all, is used as data field

Error detection-- crc, Error Detection-- CRC Powerful error detecti...

Error Detection-- CRC Powerful error detection system Rather than addition, binary division is utilized A series of redundant bits called "CRC" or else "CRC remai

Describe in detail how rsvp actually works, Normal 0 false fa...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Two commands that copies the configuration in nvram to ram, Recognize the t...

Recognize the two commands that copies the configuration in NVRAM to RAM Ans) a) Copy startup-config running-config b)  Configure memory

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