Parallel programming model: Difference between revisions

Revision as of 13:55, 21 March 2024

Revision as of 13:56, 21 March 2024

Line 5:

==Classification of parallel programming models==

Classifications of parallel programming models can be divided broadly into two areas: process interaction and problem decomposition.<ref>John E. Savage, Models of Computation: Exploring the Power of Computing, 2008, Chapter 7 (Parallel Computation), http://cs.brown.edu/~jes/book/ {{Webarchive|url=https://web.archive.org/web/20161105053330/http://cs.brown.edu/~jes/book/ |date=2016-11-05 }}</ref><ref>{{Cite web |title=1.3 A Parallel Programming Model |url=https://www.mcs.anl.gov/~itf/dbpp/text/node9.html |access-date=2024-03-21 |website=www.mcs.anl.gov}}</ref><ref name=":0">{{Cite web |title=Introduction to Parallel Computing Tutorial {{!}} HPC @ LLNL |url=https://hpc.llnl.gov/documentation/tutorials/introduction-parallel-computing-tutorial |access-date=2024-03-21 |website=hpc.llnl.gov}}</ref>

===Process interaction===

Line 27:

===Problem decomposition===

A parallel program is composed of simultaneously executing processes. Problem decomposition relates to the way in which the constituent processes are formulated.<ref>{{Cite web |title=2.2 Partitioning |url=https://www.mcs.anl.gov/~itf/dbpp/text/node16.html |access-date=2024-03-21 |website=www.mcs.anl.gov}}</ref><ref>Blaise Barney, Introduction to Parallel Computing, name="Partitioning:0", 2015, Lawrence Livermore National Laboratory, https://computing.llnl.gov/tutorials/parallel_comp/#DesignPartitioning {{Webarchive|url=https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/#DesignPartitioning |date=2013-06-10 }}</ref>

====Task parallelism====