Introduction-parallel algorithms, Computer Networking

Assignment Help:

Introduction

An algorithm is defined as a series of computational steps required to accomplish an exact task. The algorithm works for a given input and will terminate in a well distinct state. The basic conditions of an algorithm are: input, output, effectiveness, definiteness and finiteness. The purpose of the development an algorithm is to resolve a general, well specified problem.

A concern while designing an algorithm also pertains to the type of computer on which the algorithm would be implemented. The two forms of architectures of computers are given: sequential computer and parallel computer. Thus, depending upon the architecture of the computers, we contain sequential as well as parallel algorithms.

The algorithms which are implemented on the sequential computers simply perform according to sequence of steps for resolving a given problem. Such algorithms are called as sequential algorithms.

However, a trouble can be solved after separating it into sub-problems and those in turn are implemented in parallel. Later on, the results of the answers of these sub problems can be combined together and the last solution can be achieved. In such situations, the number of processors needed would be more than one and they would be communicating with each other for producing the final output. This environment operates on the parallel computer and the special kind of algorithms known parallel algorithms are designed for these computers. The parallel algorithms depend on the type of parallel computer they are designed for. Therefore, for a given problem, there would be a need to design the dissimilar kinds of parallel algorithms depending upon the kind of parallel architecture.                

A parallel computer is a set of processors that are capable to work cooperatively to resolve a computational problem. This definition is broad sufficient to include parallel supercomputers that have hundreds or thousands of processors, multiple-processor workstations, networks of workstations, and embedded systems. The parallel computers can be characterized with the help of various kinds of models given as random access machine (RAM), Interconnection Networks ,parallel random access machine (PRAM) etc. While designing a parallel algorithm, the computational power of a variety of models can be analyzed and measured, parallelism can be involved for a given difficulty on a specific model after understanding the characteriscitics of a model. The analysis of parallel algorithm on dissimilar models assist in determining the best model for a problem after receiving the results in terms of the space and time complexity.

In this part, we have first discussed the various parameters for analysis of an algorithm. After that, the various types of computational models such as combinational circuits etc. have been presented. Then, a few problems have been taken up, e.g., matrix multiplication, sorting  etc. and solved using parallel algorithms with the help of a variety of parallel compuational models.


Related Discussions:- Introduction-parallel algorithms

What is internet, I have a project on Information Communication Technology(...

I have a project on Information Communication Technology(I.C.T). So sir I want to know that what is internet? and how it works?

Intradomain and interdomain routing protocols?, Describe the concept of int...

Describe the concept of intradomain and interdomain routing protocols?

Command that configures serial0 for ppp encapsulation, Recognize the comman...

Recognize the command that configures serial0 for PPP encapsulation Ans) Router(config-if)# encapsulation ppp

Example of wan technologies, Some multiple WAN methods are defined below: ...

Some multiple WAN methods are defined below: ARPANET: It start in 1960's. It was operated by Advanced Research Project Agency, which is a company of US defense department.

Calculate utilization percentage of the link, Q. Calculate Utilization perc...

Q. Calculate Utilization percentage of the link? - System: Stop and wait ARQ - Bandwidth: 1Mbps - Round trip for one bit: 20ms - Frame length: 1000 bits Utilizatio

Permutation representation through matrix, Q. Permutation representation th...

Q. Permutation representation through Matrix? Figure: Clos Network The functioning of this above permutation is displayed in Figure. This permutation is able to

Explain ring interconnection networks, Ring: It is a simple linear array w...

Ring: It is a simple linear array where end nodes are associated.  It is equal to a mesh with wrap around connections.  The data transfer in a ring is generally one direction. So,

System analysis, explain the appropriateness of economic and behavioral fea...

explain the appropriateness of economic and behavioral feasibility

Routing by rumor, What is the major issue with routing by rumor?

What is the major issue with routing by rumor?

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