The generation of the Mandelbrot set is a typical seemingly embarrassingly parallel problem because each initial data set generates an event independent of the others. There are, though, several technicalities implied by the transformation from the sequential algorithm to the parallel one to be performed leading to different performances depending on the computational approach chosen. The paper discusses two different parallelization schemes and rationalizes why they lead to different performances by making some considerations about the tools used.
