Science Fair Project Encyclopedia
Embarrassingly parallel problem
An embarrassingly parallel problem is a parallel computing problem that can easily, or very obviously, be split up into parts that can be computed in parallel. What these problems generally have in common is that each step can be computed independently from every other step, thus each step could be made to run on a separate processor to achieve quicker results. Examples of embarrassingly parallel problems include the computation of the Mandelbrot set, brute force key searches in cryptography, and ray tracing.
See also
12-19-2008 14:25:18
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details