Data parallel programming with parallel virtual machine, Computer Networking

Assignment Help:

Data Parallel Programming

In the data parallel programming model, main focus is on performing simultaneous operations on a data set. The data set is typically prepared into a common structure, such as an hypercube or array.  Processors work collectively on the similar data structure. Though, every task works on a different partition of the similar data structure. It is more restrictive because not all algorithms can be shows in the data-parallel terms. For the reasons, data parallelism, although main, is not a universal parallel programming paradigm.

Programming with the data parallel model is generally accomplished by writing a program with the data parallel constructs. The constructs can be called to a compiler directives or data parallel subroutine library. Data parallel languages give facilities to states the data decomposition and mapping to the processors. The languages have data distribution statements, which let the programmer to control which data goes on what processor to minimize the quantity of communication between the processors. Directives show how arrays are to be aligned and distributed over the processors and therefore specify agglomeration and mapping. Communication operations are not particular explicitly by the programmer, but are instead inferred by the compiler from the program. Data parallel languages are more suitable for SIMD architecture however some languages for MIMD structure have also been executed. Data parallel approach is more effective for highly regular troubles, but are not very effective for irregular troubles.

The major languages used for this are Fortran 90, High Performance Fortran (HPF) and HPC++. We shall talk about HPF in detail in the next unit. Now, we shall give a short overview of some of the early data parallel languages:

  • Computational Fluid Dynamics: CFD was a FORTRAN-like language developed in the early 70s at the Computational Fluid Dynamics Branch of Ames Research Center for ILLIAC IV machines, a SIMD computer for array processing. The language design was very pragmatic. No attempt was made to cover the hardware peculiarities from the user; in fact, each attempt was made to give the programmers the access and control of all of the hardware to help constructing efficient programs. This language made the architectural types of the ILLIAC IV very apparent to the programmer, but it also contained the seeds of a few practical programming language abstractions for data-parallel programming. In spite of its ad hoc and simplicity machine-dependencies, CFD permits the researchers at Ames to develop a range of application programs that efficiently used the ILLIAC IV.
  • Connection Machine Fortran: Connection Machine Fortran was a later SIMD language developed by Thinking Machines Corporation. Connection Machine Fortran included all of FORTRAN 77, together with the latest array syntax of Fortran 90. It added a variety of machine shows features, but unlike CFD or DAP FORTRAN these appeared as compiler directives rather than usual syntax in Fortran declarations or implementable statements. A main improvement over the earlier languages was that, distributed array dimensions were no longer constrained to precisely fit in the size of the processing element array; the compiler could transparently map dimensions of arbitrary extent across the existing processor grid dimensions. At last the language added an explicitly parallel looping construct called FORALL. While CM Fortran looked syntactically like standard Fortran, the programmer had to be aware of numerous nuances. Like the ILLIAC IV, the Connection.

Machine permitted the Fortran arrays to either be distributed across the processing nodes (called distributed arrays, or CM arrays), or allocated in the memory of the front-end computer (called sequential arrays or front-end arrays). Unlike the control unit of the ILLIAC, the Connection Machine front-end was a ordinary, general-purpose computer--typically a Sun or VAX. But there were still significant restrictions on how arrays could be manipulate, reflecting the two possible homes.

Glypnir ,IVTRAN and *LISP are a little of the other early data parallel languages.

Let us conclude this unit with the introduction of a typical data parallel programming

style known as SPMD.


Related Discussions:- Data parallel programming with parallel virtual machine

State the nonselective fading and selective fading, Nonselective fading and...

Nonselective fading and Selective fading Nonselective fading, is a fading in which all frequency methods of the received signal fluctuate in the similar proportions simultaneo

Connectionless protocol at the transport layer, User Datagram Protocol - UD...

User Datagram Protocol - UDP is a connectionless oriented transport protocol for use when the upper layers give error-recovery and reliability. UDP does not sequence data or re-ass

Calculate the voltage on the capacitor, Quetion: A 22 nF capacitor is i...

Quetion: A 22 nF capacitor is initially charged to 10V. It is then discharged by connecting a 100kW resistor across it. Approximately how long does it take for the voltage on t

Layers, Layers, Massages, Segments, Datagram's and Frames Figure 2.15 ...

Layers, Massages, Segments, Datagram's and Frames Figure 2.15 show the physical  path data takes down a  sending  end  systems  protocol  stack up and  down the  protocol stac

Processor arrangements-array, Processor Arrangements It is a very frequ...

Processor Arrangements It is a very frequent event in data parallel programming to group a number of processors to perform definite tasks. To reach this goal, HPF gives a direc

Show infrared applications, Q. Show Infrared Applications? - Wide bandw...

Q. Show Infrared Applications? - Wide bandwidth accessible for data transmission - Communication between mice, PCs, keyboards, and printers Media selection - Every

Give the structure of an atm uni cell header, a) Consider a hypothetical a...

a) Consider a hypothetical arrangement of ‘self-learning' bridges shown in the figure below. Assuming all are initially empty, give the forwarding tables for each of the bridges B

Go back-n ( gbn) - transport layer, Go Back ( GBN) Go back  N ARQ is s...

Go Back ( GBN) Go back  N ARQ is specific  instance of the  automatic  repeat request protocols  in which  the sending  process continues to send  a number of frames specific

Calculate bandwidth needed for voice traffic, The second point to consider ...

The second point to consider is that from each location, some calls are internal to that site and some are going to outside locations. Again, as an approximation, MyCo telecom peop

Analysis of sort_bitonic, The bitonic sorting network needed log n number o...

The bitonic sorting network needed log n number of stages for performing the task of sorting the list. The first n-1 stages of the circuit are able to sort two n/2 numbers and the

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