Embarrassingly parallel: Difference between revisions

Revision as of 20:12, 10 November 2020

Revision as of 01:23, 11 December 2020

Line 1:

[[Parallel computing]], a paradigm in computing which has multiple tasks running simultaneously, might contain what is known as an '''embarrassingly parallel''' workload or problem (also called '''perfectly parallel''', '''delightfully parallel''' or '''pleasingly parallel'''{{citation needed|date=October 2020}}). An embarrassingly parallel task can be considered a trivial case - little or no manipulation is needed to separate the problem into a number of parallel tasks.<ref>{{cite book|last1=Herlihy|first1=Maurice|last2=Shavit|first2=Nir|title=The Art of Multiprocessor Programming, Revised Reprint|date=2012|publisher=Elsevier|isbn=9780123977953|page=14|edition=revised|url=https://books.google.com/books?id=vfvPrSz7R7QC&q=embarrasingly|accessdateaccess-date=28 February 2016|quote=Some computational problems are “embarrassingly parallel”: they can easily be divided into components that can be executed concurrently.}}</ref> This is often the case where there is little or no dependency or need for communication between those parallel tasks, or for results between them.<ref name=dbpp>Section 1.4.4 of: {{cite book

|url=http://www.mcs.anl.gov/~itf/dbpp/text/node10.html

|title=Designing and Building Parallel Programs

|author=Foster, Ian

|publisher=Addison–Wesley

|archiveurlarchive-url=https://web.archive.org/web/20110301095228/http://www.mcs.anl.gov/~itf/dbpp/text/node10.html

|archivedatearchive-date=2011-03-01

|year=1995

|url-status=dead

Line 37:

* 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 (see [[parallel rendering]]).

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

* [[BLAST]] searches in [[bioinformatics]] for multiple queries (but not for individual large queries).<ref>[http://seqanswers.com/forums/showpost.php?p=21050&postcount=3 SeqAnswers forum]</ref>

* Large scale [[facial recognition system]]s that compare thousands of arbitrary acquired faces (e.g., a security or surveillance video via [[closed-circuit television]]) with similarly large number of previously stored faces (e.g., a ''[[rogues gallery]]'' or similar [[No Fly List|watch list]]).<ref>[http://lbrandy.com/blog/2008/10/how-we-made-our-face-recognizer-25-times-faster/ How we made our face recognizer 25 times faster] (developer blog post)</ref>