Content deleted Content added
Hunterwright (talk | contribs) |
|||
Line 5:
A programming model is usually judged by its expressibility and simplicity, which are by all means conflicting factors. The ultimate goal is to improve productivity of programming.
== Example parallel programming models
Libraries
* [[Parallel Random Access Machine]]▼
* [[POSIX Threads]]
* [[Ada (programming language)|Ada]] tasks▼
* [[Parallel Virtual Machine|PVM]]▼
* [[Message Passing Interface|MPI]]
* [[SHMEM]]▼
▲* [[Parallel Virtual Machine|PVM]]
Languages
* [[Cilk]]▼
* [[Partitioned global address space]] languages: ▼
** [[Unified Parallel C|UPC]],▼
** [[Co-array Fortran]], ▼
** Titanium▼
* [[HPF]]▼
Unsorted
▲* [[Ada (programming language)|Ada]] tasks
* [[OpenMP]]
* [[Intel Threading Building Blocks|TBB]]
* [[Charm++]]
▲* [[Cilk]]
* [[Global Arrays]]
▲* [[HPF]]
* [[Intel Ct]]
* [[Pervasive DataRush]]
* [[ProActive]]
▲* [[Parallel Random Access Machine]]
▲* [[SHMEM]]
* [[Stream processing]]
* [[Ambric#Architecture_and_Programming_Model|Structural Object Programming Model (SOPM)]]
* [[Pipeline (software)|Pipelining]]
▲* [[Partitioned global address space]] languages:
▲** [[Unified Parallel C|UPC]],
▲** [[Co-array Fortran]],
▲** Titanium
* [[Occam (programming language)]]
* [[Ease (programming language)]]
| |||