Embarrassingly parallel: Difference between revisions

Revision as of 18:45, 16 October 2024

Latest revision as of 22:35, 29 March 2025

(3 intermediate revisions by 3 users not shown)

Line 31:

==Examples==

A trivial example involves serving static data. It would take very little effort to have many processing units produce the same set of bits. Indeed, the famous [["Hello, World!" program|Hello World]] problem could easily be parallelized with few programming considerations or computational costs.

Some examples of embarrassingly parallel problems include:

* [[Monte Carlo analysismethod]]<ref name="Kontoghiorghes2005">{{cite book|author=Erricos John Kontoghiorghes|title=Handbook of Parallel Computing and Statistics|url=https://books.google.com/books?id=BnNnKPkFH2kC&q=%22embarrassingly+parallel%22|date=21 December 2005|publisher=CRC Press|isbn=978-1-4200-2868-3}}</ref>

* Distributed relational database queries using [http://www.mysqlperformanceblog.com/2011/05/14/distributed-set-processing-with-shard-query/ distributed set processing].

* [[Numerical integration]]<ref name="Deng2013">{{cite book|author=Yuefan Deng|title=Applied Parallel Computing|url=https://books.google.com/books?id=YS9wvVeWrXgC&q=%22embarrassingly+parallel%22|year=2013|publisher=World Scientific|isbn=978-981-4307-60-4}}</ref>

* Bulk processing of unrelated files of similar nature in general, such as photo gallery resizing and conversion.

* The [[Mandelbrot set]], [[Perlin noise]] and similar images, where each point is calculated independently.

* [[Rendering (computer graphics)|Rendering]] of [[computer graphics]]. In [[computer animation]], each [[video frame|frame]] or pixel may be rendered independently {{xref|(see: [[parallelParallel rendering]])}}.

* Some [[brute-force search]]es in [[cryptography]].<ref>{{Cite journal|url=https://tools.ietf.org/html/rfc7914#page-2|title=The scrypt Password-Based Key Derivation Function|first1=Simon|last1=Josefsson|first2=Colin|last2=Percival|author-link2=Colin Percival|date=August 2016|website=tools.ietf.org|doi=10.17487/RFC7914 |access-date=2016-12-12}}</ref> Notable real-world examples include [[distributed.net]] and [[proof-of-work]] systems used in [[cryptocurrency]].

* [[BLAST (biotechnology)|BLAST]] searches in [[bioinformatics]] with split databases.<ref>{{cite journal |last1=Mathog |first1=DR |title=Parallel BLAST on split databases. |journal=Bioinformatics |date=22 September 2003 |volume=19 |issue=14 |pages=1865–6 |doi=10.1093/bioinformatics/btg250 |pmid=14512366|doi-access=free }}</ref>

Line 56 ⟶ 58:

==See also==

{{#invoke:sort list|asc|*[[Amdahl's law]] defines value ''[[Amdahl's law#Parallelization|P]]'', which would be almost or exactly equal to 1 for embarrassingly parallel problems.

*[[Cellular automaton]]

*[[Connection Machine]]

*[[CUDA|CUDA framework]]

*[[Manycore processor]]

*[[Map (parallel pattern)]]

*[[Multiprocessing]]

*[[Massively parallel]]

*[[Multiprocessing]]

*[[Parallel computing]]

*[[Process-oriented programming]]

*[[Shared-nothing architecture]] (SN)

*[[Symmetric multiprocessing]] (SMP)

*[[ConnectionVector Machineprocessor]]

*[[Cellular automaton]]

*[[CUDA|CUDA framework]]

*[[Manycore processor]]

*[[Vector processor]]}}

==References==

<references/>