Introduction-parallel algorithms, Computer Networking

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.

Posted Date: 3/2/2013 6:21:52 AM | Location : United States







Related Discussions:- Introduction-parallel algorithms, Assignment Help, Ask Question on Introduction-parallel algorithms, Get Answer, Expert's Help, Introduction-parallel algorithms Discussions

Write discussion on Introduction-parallel algorithms
Your posts are moderated
Related Questions
objective practical questios answers

What is DHCP? DHCP is short for Dynamic Host Configuration Protocol. Its major task is to automatically assign an IP address to devices across the network. It first checks for


Wait protocol The wait protocol is used for resolving the conflicts, which arise due to number of multiprocessors demanding the same resource. There are two types of wait prot

State the example of intranet security Imagine a situation when a company develops a major new product secretly using its Intranet. Hackers break the security and take away all

What is the disadvantage of a star topology? One major drawbacks of star topology is that once the central hub or switch get damaged, the whole network becomes unusable.

Pretty much any end-user program is an best example of the Application Layer.

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?

Configure the management interface address on all three switches.  S1(config)#interface vlan1 S1(config-if)#ip address 172.17.10.1 255.255.255.0 S1(config-if)#no shutdown

Subscriber Database Core network  also hosts  the subscribers  database ( for e, g HLR in GSM systems). Subscriber  database  is accessed by core  network  nodes fro  funct