Parallel programming model: Difference between revisions

Revision as of 05:38, 23 November 2015

Revision as of 07:41, 23 November 2015

Line 35:

====Implicit parallelism====

{{main|Implicit parallelism}}

As with implicit process interaction, an implicit model of parallelism reveals nothing to the programmer as the the compiler, the runtime or the hardware is responsible. For example, in compilers, [[automatic parallelization]] is the process of converting sequential code into parallel code, and in computer architecture, [[Superscalar processor|superscalar execution]] is a mechanism whereby [[instruction-level parallelism]] is exploited to perform operations in parallel.

==Terminology==

Parallel programming models are closely related to [[model of computation|models of computation]]. A model of parallel computation is an [[abstraction]] used to analyze the cost of computational processes, but it does not necessarily need to be practical, in that it can be implemented efficiently in hardware and/or software. A programming model, in contrast, does specifically imply the practical considerations of hardware and software implementation.<ref>Skillicorn, David B., and Domenico Talia, Models and languages for parallel computation, ACM Computing Surveys (CSUR), 30.2 123-169 (1998), https://www.cs.utexas.edu/users/browne/CS392Cf2000/papers/ModelsOfParallelComputation-Skillicorn.pdf}}</ref>

A parallel programming language may be based on one or a combination of programming models. For example, [[High Performance Fortran]] is based on shared-memory interactions and data-parallel problem decomposition, and [[Go (programming language)|Go]] provides mechanism for shared-memory and message-passing interaction.