GL-Z: OpenGL Information Utility for Windows, Linux and OS X
GL-Z 0.1.0
 
GLSL 4×4 Matrix Fields
GLSL 4×4 Matrix Fields
 
FurMark, GPU stress test
FurMark 1.15.0
 
GPU Caps Viewer
GPU Caps Viewer 1.22.0
 
GLSL Hacker - Pixel hacking with GLSL, Lua and Python on Windows, Linux and Mac OS X
GLSL Hacker 0.8.0
Win/Linux/OSX
OpenGL Geometry Instancing Test: Radeon vs GeForce
BenQ BL3200PT 32-inch
QHD Monitor

Posts Tagged ‘mandelbrot benchmark’


Kümmel Mandelbrot Benchmark

Be the first to comment - What do you think?  Posted by JeGX - 2008/07/27 at 10:52

Categories: Benchmarks   Tags: , , , ,

The aim of this program is to explore the possibilities of modern 32bit CPU’s how to speed up (without any loss of precision or non-exact calculation) the traditional Mandelbrot algorithm including also full support for multiple cores. The Mandelbrot algorithm is implemented with double precision floating point numbers. You will find 3 different in the archive file:

  • KMB_V0.53H-32b-MT_FPU…..: only standard FPU code is used for calculation
  • KMB_V0.53H-32b-MT_SSE2….: SSE2 tuned version almost best for all CPU’s
  • KMB_V0.53H-32b-MT_SSE2_PM.: SSE2 tuned version especially for Intel Pentium M and Intel Core1 CPUs (it’s in fact KMB_V0.53G-32b-MT_SSE2 as Version H was slower)

Download Kümmel Mandelbrot Benchmark HERE.

Here are my scores on an old clock-stock Core2Duo 6600: