Embarrassingly parallel: Difference between revisions

Revision as of 23:44, 7 June 2021

Revision as of 23:45, 7 June 2021

Line 38:

* 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|last1first1=Simon|first1last1=Josefsson|last2first2=Colin|first2last2=Percival|author-link2=Colin Percival|date=August 2016|website=tools.ietf.org|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>