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. An example of an embarrassingly parallel problem is the computation of the Mandelbrot set.

See also: Amdahl's law