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, and brute force key searches in cryptography.