Introduction to parallel programming, Computer Networking

Assignment Help:

Introduction To Parallel Programming

After getting an enormous breakthrough in the serial programming and figuring out its limitations, academicians and computer professionals are focusing now on parallel programming. Parallel programming is a well-liked choice today for multi-processor architectures to solve the complex problems. If developments in the last decade give any indications, then the future belongs to of parallel computing. Parallel programming is intended to take benefits the of non-local resources to save cost and time and overcome the memory constraints.

In this section, we shall introduce parallel programming and its classifications. We shall talk about some of the high level programs used for parallel programming. There are certain compiler-directive based packages, which can be used along with some high level languages. We shall also have a detailed look upon them.

Usually, software has been written for serial computation in which programs are written for computers having a single Central Processing Unit (CPU). Here, the troubles are solved by a series of instructions, implemented one after the other, one at a time, by the CPU. Though, many complex, interrelated events happening at the same time like galactic orbital and planetary events, weather and ocean patterns and tectonic plate drift may needs super high complexity serial software. To solve these big problems and save the computational time, a new programming paradigm called parallel programming was introduced.

To develop a parallel program, we must first decide whether the problem has any part which can be parallelized. There are some problems like producing the Fibonacci sequence in the case of which there is a little scope for parallelization. Once it has been determined that the problem has some segment that can be parallelized, we break the problem into discrete chunks of work that can be distributed to multiple tasks. This partition of the problem may be data-centric or function-centric. In the earlier case, different functions work with different subsets of data while in the latter every function performs a portion of the overall work. Depending upon the type of partition approach, we need communication between the processes. Accordingly, we have to design the mechanisms for process synchronization and mode of communication.


Related Discussions:- Introduction to parallel programming

Name the 10base5 connectors, 10Base5 Connectors Transceiver - inter...

10Base5 Connectors Transceiver - intermediary device as well called a medium attachment unit (MAU) Performs CSMA/CD function may perhaps contain small buffer Atta

How xor operations can implement key stream attacks, Question: a) In a...

Question: a) In a wireless network where WEP is enforced as security mechanism, what procedure would the network manager adopt for changing WEP default keys. b) Using Pla

Enumerate about the traffic policing, Enumerate about the Traffic policing ...

Enumerate about the Traffic policing Traffic policing happens when a flow of data is regulated so that cells (or frames or packets) that exceed a performance level are discarde

What are the major technologies to create client application, What are the ...

What are the five major technologies that can be used to create Client/Server applications? Database Servers Groupware TP Monitors Distributed Objects Intranets.

Host system in tcp-ip model, Q. Host System in TCP-IP model? - Standard...

Q. Host System in TCP-IP model? - Standards adopted because of widespread use like (Internet) - The protocols came first plus the model was really just a description of the

Sharing information - network layer and routing , Sharing  information  ...

Sharing  information  To understand  how distance vector routing  works examine the  internet shown in  the  clouds represents local  area network . the  number  inside each c

Layers, what are the layers covered under end to end later connectivity?

what are the layers covered under end to end later connectivity?

Vector-distance algorithm, Vector-Distance algorithm illustrated in more d...

Vector-Distance algorithm illustrated in more detail below: Packet switches wait for next update message and they goes by entries in packet. If entry has least path to destinat

Inductor, #clasification of inductor

#clasification of inductor

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