Parallel programming model: Difference between revisions

Content deleted Content added
Reverted good faith edit(s) by Kazemi alireza using STiki
lx
Line 1:
A '''parallel programming model''' is a concept that enables the expression of [[parallel programsprogram]]s which can be compiled and executed. The value of a programming model is usually judged on its generality: how well a range of different problems can be expressed and how well they execute on a range of different architectures. The implementation of a programming model can take several forms such as libraries invoked from traditional [[sequential programming|sequential]] languages, language extensions, or complete new execution models.
 
Consensus on a particular programming model is important as it enables software expressed within it to be transportable between different architectures. The [[von Neumann model]] has facilitated this with sequential architectures as it provides an efficient ''bridge'' between hardware and software, meaning that high-level languages can be efficiently compiled to it and it can be efficiently implemented in hardware.<ref name="Valiant1990">Leslie G. Valiant, A bridging model for parallel computation, Commun. ACM, volume 33, issue 8, August, 1990, pages 103--111</ref>
Line 45:
* [[Algorithmic skeleton|Algorithmic Skeletons]]
* Components
* [[Distributed Objectsobjects]]
* [[Remote Method Invocation]]
* Workflows
* [[Parallel Random Access Machine]]