Parallel programming model - Revision history

Naruyoko: /* Partitioned global address space */Remove a duplicate word

2024-10-23T03:06:14Z

Partitioned global address space: Remove a duplicate word

← Previous revision		Revision as of 03:06, 23 October 2024
Line 20:		Line 20:
	====Partitioned global address space====		====Partitioned global address space====
	{{main\|Partitioned global address space}}		{{main\|Partitioned global address space}}
	Partitioned Global Address Space (PGAS) models provide a middle ground between shared memory and message passing. PGAS provides a global memory address space abstraction that is logically partitioned, where a portion is local to each process. Parallel processes communicate by asynchronously performing operations (e.g. reads and writes) on the global address space, in a manner reminiscent of shared memory models. However by semantically partitioning the global address space into portions with affinity to a particular processes, they allow programmers to exploit [[locality of reference]] and enable efficient implementation on [[distributed memory]] parallel computers. PGAS is offered by ~~many~~ many parallel programming languages and libraries, such as [[Fortran 2008]], [[Chapel (programming language)\|Chapel]], [http://upcxx.lbl.gov UPC++], and [[SHMEM]].		Partitioned Global Address Space (PGAS) models provide a middle ground between shared memory and message passing. PGAS provides a global memory address space abstraction that is logically partitioned, where a portion is local to each process. Parallel processes communicate by asynchronously performing operations (e.g. reads and writes) on the global address space, in a manner reminiscent of shared memory models. However by semantically partitioning the global address space into portions with affinity to a particular processes, they allow programmers to exploit [[locality of reference]] and enable efficient implementation on [[distributed memory]] parallel computers. PGAS is offered by many parallel programming languages and libraries, such as [[Fortran 2008]], [[Chapel (programming language)\|Chapel]], [http://upcxx.lbl.gov UPC++], and [[SHMEM]].

	====Implicit interaction====		====Implicit interaction====

Citation bot: Removed parameters. | Use this bot. Report bugs. | #UCB_CommandLine

2024-06-22T07:10:01Z

Removed parameters. | Use this bot. Report bugs. | #UCB_CommandLine

← Previous revision		Revision as of 07:10, 22 June 2024
Line 124:		Line 124:
	* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}		* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}
	* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}		* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}
	* {{Cite book\|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \|date=1993 \|title=Proceedings of Workshop on Programming Models for Massively Parallel Computers \|chapter=Structured parallel programming ~~\| year = 1993~~ \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}		* {{Cite book\|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \|date=1993 \|title=Proceedings of Workshop on Programming Models for Massively Parallel Computers \|chapter=Structured parallel programming \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}
	* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}		* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}

2600:6C46:4F7F:D4BE:39F1:19D3:57D0:3E10 at 10:46, 14 April 2024

2024-04-14T10:46:06Z

← Previous revision		Revision as of 10:46, 14 April 2024
Line 1:		Line 1:
	{{Short description\|Abstraction of parallel computer architecture}}		{{Short description\|Abstraction of parallel computer architecture}}
	In [[computing]], a '''parallel programming model''' is an [[Abstraction (software engineering)\|abstraction]] of [[parallel computing\|parallel computer]] architecture, with which it is convenient to express [[algorithms]] and their composition in [[Computer program\|programs]]. The value of a programming model can be judged on its ''generality'': how well a range of different problems can be expressed for a variety of different architectures, and its ''performance'': how efficiently the compiled programs can execute.<ref>Skillicorn, David B., "Models for practical parallel computation", International Journal of Parallel Programming, 20.2 133–158 (1991), https://www.ida.liu.se/~chrke55/papers/modelsurvey.pdf</ref> The implementation of a parallel programming model can take the form of a [[Library (computing)\|library]] invoked from a [[~~sequential~~ programming~~\|sequential~~ language]], as an extension to an existing ~~language, or as an entirely new language~~.		In [[computing]], a '''parallel programming model''' is an [[Abstraction (software engineering)\|abstraction]] of [[parallel computing\|parallel computer]] architecture, with which it is convenient to express [[algorithms]] and their composition in [[Computer program\|programs]]. The value of a programming model can be judged on its ''generality'': how well a range of different problems can be expressed for a variety of different architectures, and its ''performance'': how efficiently the compiled programs can execute.<ref>Skillicorn, David B., "Models for practical parallel computation", International Journal of Parallel Programming, 20.2 133–158 (1991), https://www.ida.liu.se/~chrke55/papers/modelsurvey.pdf</ref> The implementation of a parallel programming model can take the form of a [[Library (computing)\|library]] invoked from a [[programming language]], as an extension to an existing languages.

	Consensus around a particular programming model is important because it leads to different parallel computers being built with support for the model, thereby facilitating [[Software portability\|portability]] of software. In this sense, programming models are referred to as ''[[bridging model\|bridging]]'' between hardware and software.<ref name="Valiant1990">Leslie G. Valiant, "A bridging model for parallel computation", Communications of the ACM, Volume 33, Issue 8, August, 1990, pages 103–111.</ref>		Consensus around a particular programming model is important because it leads to different parallel computers being built with support for the model, thereby facilitating [[Software portability\|portability]] of software. In this sense, programming models are referred to as ''[[bridging model\|bridging]]'' between hardware and software.<ref name="Valiant1990">Leslie G. Valiant, "A bridging model for parallel computation", Communications of the ACM, Volume 33, Issue 8, August, 1990, pages 103–111.</ref>

Ecangola: /* Problem decomposition */ fmt

2024-03-21T13:56:07Z

Problem decomposition: fmt

← Previous revision		Revision as of 13:56, 21 March 2024
Line 5:		Line 5:

	==Classification of parallel programming models==		==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>{{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>		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===		===Process interaction===
Line 27:		Line 27:

	===Problem decomposition===		===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,~~ "~~Partitioning~~", 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~~>		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 name=":0" />

	====Task parallelism====		====Task parallelism====

Ecangola: /* Problem decomposition */ fmt

2024-03-21T13:55:35Z

Problem decomposition: fmt

← Previous revision		Revision as of 13:55, 21 March 2024
Line 27:		Line 27:

	===Problem decomposition===		===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>~~Ian~~ ~~Foster, Designing and Building Parallel Programs, 1995, Section~~ 2.2, "Partitioning", ~~http~~://www.mcs.anl.gov/~itf/dbpp/text/node16.html</ref><ref>Blaise Barney, Introduction to Parallel Computing, "Partitioning", 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>		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, "Partitioning", 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====		====Task parallelism====

Ecangola: /* Classification of parallel programming models */ fmt

2024-03-21T13:55:20Z

Classification of parallel programming models: fmt

← Previous revision		Revision as of 13:55, 21 March 2024
Line 5:		Line 5:

	==Classification of parallel programming models==		==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>~~Blaise~~ ~~Barney,~~ Introduction to Parallel Computing, ~~"Models",~~ ~~2015,~~ ~~Lawrence~~ ~~Livermore~~ ~~National~~ ~~Laboratory,~~		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>{{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>
	https://computing.llnl.gov/tutorials/parallel_comp/#Models {{Webarchive\|url=https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/#Models \|date=2013-06-10 }}</ref>

	===Process interaction===		===Process interaction===

Ecangola: /* Classification of parallel programming models */ fmt

2024-03-21T13:55:08Z

Classification of parallel programming models: fmt

← Previous revision		Revision as of 13:55, 21 March 2024
Line 5:		Line 5:

	==Classification of parallel programming models==		==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>~~Ian~~ ~~Foster, Designing and Building Parallel Programs, 1995, Section~~ 1.3, "A Parallel Programming Model", ~~http~~://www.mcs.anl.gov/~itf/dbpp/text/node9.html</ref><ref>Blaise Barney, Introduction to Parallel Computing, "Models", 2015, Lawrence Livermore National Laboratory,		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>Blaise Barney, Introduction to Parallel Computing, "Models", 2015, Lawrence Livermore National Laboratory,
	https://computing.llnl.gov/tutorials/parallel_comp/#Models {{Webarchive\|url=https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/#Models \|date=2013-06-10 }}</ref>		https://computing.llnl.gov/tutorials/parallel_comp/#Models {{Webarchive\|url=https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/#Models \|date=2013-06-10 }}</ref>

Citation bot: Add: date. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 1447/2044

2023-08-04T13:41:53Z

Add: date. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 1447/2044

← Previous revision		Revision as of 13:41, 4 August 2023
Line 125:		Line 125:
	* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}		* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}
	* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}		* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}
	* {{Cite book\|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \|title=Proceedings of Workshop on Programming Models for Massively Parallel Computers \|chapter=Structured parallel programming \| year = 1993 \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}		* {{Cite book\|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \|date=1993 \|title=Proceedings of Workshop on Programming Models for Massively Parallel Computers \|chapter=Structured parallel programming \| year = 1993 \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}
	* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}		* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}

Citation bot: Alter: title, template type. Add: chapter. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 1344/2384

2023-07-24T23:47:37Z

Alter: title, template type. Add: chapter. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 1344/2384

← Previous revision		Revision as of 23:47, 24 July 2023
Line 125:		Line 125:
	* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}		* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}
	* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}		* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}
	* {{~~Citation~~ \|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \| ~~year~~ = ~~1993~~ \| ~~title~~ = ~~Structured~~ Parallel ~~Programming~~ \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}		* {{Cite book\|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \|title=Proceedings of Workshop on Programming Models for Massively Parallel Computers \|chapter=Structured parallel programming \| year = 1993 \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}
	* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}		* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}

Valebes: /* Problem decomposition */ Added Stream Parallelism

2023-07-17T11:29:48Z

Problem decomposition: Added Stream Parallelism

← Previous revision		Revision as of 11:29, 17 July 2023
Line 37:		Line 37:
	{{main\|Data parallelism}}		{{main\|Data parallelism}}
	A data-parallel model focuses on performing operations on a data set, typically a regularly structured array. A set of tasks will operate on this data, but independently on disjoint partitions. In [[Flynn's taxonomy]], data parallelism is usually classified as [[Multiple instruction, multiple data\|MIMD]]/[[SPMD]] or [[Single instruction, multiple data\|SIMD]].		A data-parallel model focuses on performing operations on a data set, typically a regularly structured array. A set of tasks will operate on this data, but independently on disjoint partitions. In [[Flynn's taxonomy]], data parallelism is usually classified as [[Multiple instruction, multiple data\|MIMD]]/[[SPMD]] or [[Single instruction, multiple data\|SIMD]].

			====Stream Parallelism====
			Stream parallelism, also known as pipeline parallelism, focuses on dividing a computation
			into a sequence of stages, where each stage processes a portion of the input
			data. Each stage operates independently and concurrently, and the output of one
			stage serves as the input to the next stage. Stream parallelism is particularly suitable
			for applications with continuous data streams or pipelined computations.

	====Implicit parallelism====		====Implicit parallelism====

← Previous revision		Revision as of 07:10, 22 June 2024
Line 124:		Line 124:
	* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}		* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}
	* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}		* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}
	* {{Cite book\|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \|date=1993 \|title=Proceedings of Workshop on Programming Models for Massively Parallel Computers \|chapter=Structured parallel programming ~~\| year = 1993~~ \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}		* {{Cite book\|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \|date=1993 \|title=Proceedings of Workshop on Programming Models for Massively Parallel Computers \|chapter=Structured parallel programming \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}
	* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}		* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}

← Previous revision		Revision as of 10:46, 14 April 2024
Line 1:		Line 1:
	{{Short description\|Abstraction of parallel computer architecture}}		{{Short description\|Abstraction of parallel computer architecture}}
	In [[computing]], a '''parallel programming model''' is an [[Abstraction (software engineering)\|abstraction]] of [[parallel computing\|parallel computer]] architecture, with which it is convenient to express [[algorithms]] and their composition in [[Computer program\|programs]]. The value of a programming model can be judged on its ''generality'': how well a range of different problems can be expressed for a variety of different architectures, and its ''performance'': how efficiently the compiled programs can execute.<ref>Skillicorn, David B., "Models for practical parallel computation", International Journal of Parallel Programming, 20.2 133–158 (1991), https://www.ida.liu.se/~chrke55/papers/modelsurvey.pdf</ref> The implementation of a parallel programming model can take the form of a [[Library (computing)\|library]] invoked from a [[~~sequential~~ programming~~\|sequential~~ language]], as an extension to an existing ~~language, or as an entirely new language~~.		In [[computing]], a '''parallel programming model''' is an [[Abstraction (software engineering)\|abstraction]] of [[parallel computing\|parallel computer]] architecture, with which it is convenient to express [[algorithms]] and their composition in [[Computer program\|programs]]. The value of a programming model can be judged on its ''generality'': how well a range of different problems can be expressed for a variety of different architectures, and its ''performance'': how efficiently the compiled programs can execute.<ref>Skillicorn, David B., "Models for practical parallel computation", International Journal of Parallel Programming, 20.2 133–158 (1991), https://www.ida.liu.se/~chrke55/papers/modelsurvey.pdf</ref> The implementation of a parallel programming model can take the form of a [[Library (computing)\|library]] invoked from a [[programming language]], as an extension to an existing languages.

	Consensus around a particular programming model is important because it leads to different parallel computers being built with support for the model, thereby facilitating [[Software portability\|portability]] of software. In this sense, programming models are referred to as ''[[bridging model\|bridging]]'' between hardware and software.<ref name="Valiant1990">Leslie G. Valiant, "A bridging model for parallel computation", Communications of the ACM, Volume 33, Issue 8, August, 1990, pages 103–111.</ref>		Consensus around a particular programming model is important because it leads to different parallel computers being built with support for the model, thereby facilitating [[Software portability\|portability]] of software. In this sense, programming models are referred to as ''[[bridging model\|bridging]]'' between hardware and software.<ref name="Valiant1990">Leslie G. Valiant, "A bridging model for parallel computation", Communications of the ACM, Volume 33, Issue 8, August, 1990, pages 103–111.</ref>

← Previous revision		Revision as of 13:41, 4 August 2023
Line 125:		Line 125:
	* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}		* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}
	* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}		* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}
	* {{Cite book\|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \|title=Proceedings of Workshop on Programming Models for Massively Parallel Computers \|chapter=Structured parallel programming \| year = 1993 \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}		* {{Cite book\|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \|date=1993 \|title=Proceedings of Workshop on Programming Models for Massively Parallel Computers \|chapter=Structured parallel programming \| year = 1993 \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}
	* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}		* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}

← Previous revision		Revision as of 23:47, 24 July 2023
Line 125:		Line 125:
	* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}		* {{Citation \| author = Blaise Barney \| institution = Lawrence Livermore National Laboratory \| title = Introduction to Parallel Computing \| url = https://computing.llnl.gov/tutorials/parallel_comp/ \| access-date = 2015-11-22 \| archive-date = 2013-06-10 \| archive-url = https://web.archive.org/web/20130610122229/https://computing.llnl.gov/tutorials/parallel_comp/ \| url-status = dead }}
	* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}		* {{Citation \| author = Murray I. Cole. \| title = Algorithmic Skeletons: Structured Management of Parallel Computation \| institution = University of Glasgow \| url = http://homepages.inf.ed.ac.uk/mic/Pubs/skeletonbook.pdf }}
	* {{~~Citation~~ \|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \| ~~year~~ = ~~1993~~ \| ~~title~~ = ~~Structured~~ Parallel ~~Programming~~ \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}		* {{Cite book\|author1=J. Darlinton \|author2=M. Ghanem \|author3=H. W. To \|title=Proceedings of Workshop on Programming Models for Massively Parallel Computers \|chapter=Structured parallel programming \| year = 1993 \| journal =In Programming Models for Massively Parallel Computers. IEEE Computer Society Press \|pages=160–169 \|doi=10.1109/PMMP.1993.315543 \|isbn=0-8186-4900-3 \|s2cid=15265646 \| url = https://www.researchgate.net/publication/3557907}}
	* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}		* {{Citation \| author = Ian Foster \| institution = Argonne National Laboratory \| title = Designing and Building Parallel Programs \| url = http://www.mcs.anl.gov/~itf/dbpp}}