These results show the performance of the GPU calculating elements of the Mandelbrot Set. The elements form a square grid with (-2 <= x <= 0.5) and (-1.25 <= y <= 1.25). Every iteration of a single element is assumed to take twelve floating point operations.

Elements that are inside the set will iterate until the maximum number of iterations is reached and are usually limited by the GPU computation speed. Elements that quickly escape from the 2-circle take very little computation and are more dependent on how fast data can be read and written from/to memory. This is therefore a reasonably balanced test of memory bandwidth and computational power.