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

Media, explain history of internet?

explain history of internet?

Distance vector multicast routing protocol, DVMRP • Distance vector mu...

DVMRP • Distance vector multicast routing protocol: Distance vector multicast routing protocol are abbreviated as DVMRP. These protocols are suitable for small networks which

What is the difference between csma/cd and csma/ca, What is the difference ...

What is the difference between CSMA/CD and CSMA/CA? CSMA/CD, or Collision Detect, retransmits data frames when a collision occurred. CSMA/CA, or Collision Avoidance, will first

Work-sharing constructs in openmp, Work-Sharing Constructs A work-shari...

Work-Sharing Constructs A work-sharing construct distributes the implementation of the associated region between the members of the team that encounters it. A work-sharing cons

Describe physical layer in osi layers model, Q. Describe Physical Layer in ...

Q. Describe Physical Layer in OSI layers model? Physical Layer : Controls the transmission of the actual data onto the network. It describes the electrical signals, line state

Ip checksum, This code properly implements the IP checksum function on a 32...

This code properly implements the IP checksum function on a 32-bit machine: unsigned short cksum(unsigned short *buf, int count) { unsigned long sum = 0; while (count--) { sum += *

Explain the working of transceivers, Explain the working of Transceivers ...

Explain the working of Transceivers Transceivers are used to connect nodes to the several Ethernet media. Most computers and network interface cards having a built-in 10BaseT o

Linked list for parallel algorithms, Linked List A linked list is a dat...

Linked List A linked list is a data structure composed of zero or extra nodes linked by pointers. Each node consists of two parts, as shown in Figure: info field having specifi

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