Embarrassingly parallel: Difference between revisions

Revision as of 01:39, 6 February 2020

Revision as of 17:46, 14 May 2020

Line 13:

Thus, these are different from [[distributed computing]] problems that need communication between tasks, especially communication of intermediate results. They are easy to perform on [[server farm]]s which lack the special infrastructure used in a true [[supercomputer]] cluster. They are thus well suited to large, Internet-based distributed platforms such as [[BOINC]], and do not suffer from [[parallel slowdown]]. The opposite of embarrassingly parallel problems are [[inherently serial problem]]s, which cannot be parallelized at all.

A common example of an embarrassingly parallel problem is 3D video rendering handled by a [[graphics processing unit]], where each frame (forward method) or pixel ([[Ray tracing (graphics)|ray tracing]] method) can be handled with no interdependency.<ref name="ChalmersReinhard2011">{{cite book|author1=Alan Chalmers|author2=Erik Reinhard|author3=Tim Davis|title=Practical Parallel Rendering|url=https://books.google.com/books?id=loxhtzzG1FYC&printsec=frontcover#v=onepage&q=%22embarrassingly%20parallel%22&f=false|date=21 March 2011|publisher=CRC Press|isbn=978-1-4398-6380-0}}</ref> Some forms of [[Passwordpassword cracking]] isare another embarrassingly parallel task that is easily distributed on [[central processing unit]]s, [[CPU core]]s, or clusters.

==Etymology==