Benchmark comparison of computing the Mandelbrot set in OpenCL

Computing the fractals can be time consuming if processed in sequential manner. Computing the fractals is iterative process so it can easily be transformed to run in parallel fashion. Since OpenCL supports parallel execution of code on both CPU and/or GPU, benchmarking and comparison the computation of Madelbrot by using OpenCL, can give insight on the speedup that modern parallel architectures have to offer. Results of these benchmarks and comparsions are given in this paper.