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 independatly from every other step, thus each step could be made to run on a seperate processor to achieve quicker results. An example of an embarrassingly parallel problem is computation of the mandelbrot set.