SSBENCH CPU benchmark test for Windows XP/2000
==============================================
Version
=======
Beta 1.08 for Windows XP/2000
This is a BETA version. Some modifications can be necessary
in the future. Please report problems!
Information about the latest changes is found in the file
bnews.txt.
Important note. This is a quite old benchmark. It does not
take advantage of dual CPU cores or 64-bit extensions.
Perhaps an updated version will be available in the future.
First version: 1998-02-24
Latest update: 2006-11-30
Author
======
By Stefan Spaennare, Lund, Sweden
E-mail: stefan@spaennare.se
The benchmark can be found on the web-page:
http://www.spaennare.se/ssbench.html
Contents
========
1. Purpose
2. Hardware requirements
3. How to run the benchmark
4. How to compile the benchmark
5. Resulting time and CPU Speed-Index
6. Feedback
7. Remove files
8. Something about images
9. Disclaimer
10. Short description of the programs
10.1. Integer programs
10.2. Floating point programs
1. Purpose
==========
The program calculates the geometric mean CPU-time
of 8 integer and 8 floating point C-programs.
Each program takes between 200 and 300 CPU-seconds
on a 180 MHz Pentium computer (see p180.txt).
The whole benchmark takes less than 10 minutes to run
on a 1000 MHz Pentium III computer (or better).
2. Hardware requirements
========================
Memory requirement: >= 32 Mbyte
Hard disk requirement: >= 20 Mbyte
3. How to run the benchmark
===========================
The Windows way
---------------
1. Turn off the screensaver.
2. Unzip the ssbench.zip file to the harddrive (C:).
3. Open the ssbench folder.
4. Double-click on the runbench.bat file icon and wait
for a while.
5. The result is then present in the result.txt file.
The DOS way
-----------
1. Turn off the screensaver.
2. Unzip the ssbench.zip file to the harddrive (C:).
3. Open a command interpreter CMD (DOS) window and go
to the ssbench directory. Below > means that the
command is typed and run at the DOS prompt.
>cd c:\ssbench
4. Run the benchmark and wait for a while:
>runbench
5. The result is then present in the result.txt file.
4. How to compile the benchmark
===============================
The author recommend to use the precompiled executables.
These are compiled using DJGPP (gcc) 3.20 for Windows
XP/2000 using the -O3 optimization option. The benchmark
is also available compiled with newer versions of DJGPP.
If you wish to compile the benchmark yourself, download
the DJGPP C/C++ compiler (about 12 Mbyte) from:
http://www.delorie.com/djgpp
Follow the instructions and install the compiler.
Then use one of the scripts compwin1.bat, compwin2.bat
or compwin3.bat to compile the files. compwin3.bat
usually give the fastest code using -O3 optimization.
>compwin3
5.Resulting CPU-time and Speed-Index
====================================
The final CPU-time is calculated as the geometric mean (GM)
of 8 programs (integer and floating point respectively).
The Speed-Index (SI) is calculated as 1000.0/GM.
6. Feedback
===========
Please fill the form "feedback.txt" with your
benchmark result added and send it to:
Stefan Spaennare
E-mail: stefan@spaennare.se
For an example see: p180.txt
If many people return their results I will put them on my
web page.
7. Remove files
===============
The executable files can be removed by:
>delfiles
and the times*.dat files by:
>deltimes
8. Something about images
=========================
Some of the programs produce and use images
which can be displayed.
For more information see the file images.txt.
9. Disclaimer
=============
For all the programs the following is valid:
I make no warranties that this program is (1) free of error, (2) con-
sistent with any standard merchantability, or (3) meeting the require-
ments of a particular application. This software shall not, partly or
as a whole, participate in a process, whose outcome can result in injury
to a person or loss of property. It is solely designed for analytical
work. Permission to use, copy, and distribute is hereby granted without
fee, providing that the header above including this notice appears in
all copies.
10. Short description of the programs
=====================================
For a better description see the header of each C-code.
All the programs use dynamical memory allocation for
the arrays.
10.1. Integer programs
======================
The most time-consuming parts of these programs use integer
calculations. Although some floating point operations are
used as well.
For parameters see the runbench.bat script.
Yahtzee:
--------
Calculates the probability to get yahtzee in 3 throws with
5 dice.
Small integer arrays.
Coin:
-----
Calculates the number to turns necessary to get a pile of
coins back in the same order when you turn them in a
certain way.
Small integer arrays.
Esift2:
-------
Calculates the number of prime numbers below n by
Erathostenes sifter. Very fast.
Large integer array.
Primes2:
--------
Calculates the number of prime numbers below n.
Slow version.
No arrays.
Primm2:
-------
Calculates the number of prime numbers below n.
Faster version.
Large integer array.
Queens2:
--------
Solves the Queens problem on a chess-board of size n.
Small integer arrays.
Medianhs2:
----------
Median filtering of an image:
Fast quick sort.
Small integer arrays.
Short integer image array.
Ssei:
-----
Calculates e = exp(1) to many decimal places.
Large short integer array.
10.2. Floating point programs
=============================
The most time-consuming parts of these programs use floating
point calculations (double precision).
Although some integer operations are used as well.
For parameters see the runbench.bat script.
Mand:
-----
Calculates a Mandelbrot fractal.
No floating point arrays. Double precision (+, - and *).
Short integer image array.
Newton:
-------
Calculates a Newton fractal.
No floating point arrays. Double precision (+. -, * and /).
Short integer image array.
Findsmbf:
---------
Astronomical photometry program FINDSTARS.
More information can be found on the web-page:
http://www.spaennare.se/ssphot.html
Many least squares fits.
Small double precision arrays.
Single precision image array.
Polyfitf:
---------
Astronomical photometry program POLYFIT.
More information can be found on the web-page:
http://www.spaennare.se/ssphot.html
Many small matrix inversions (Numerical Recipes).
Small double precision arrays.
Single precision image array.
Plotss:
-------
Makes a 3D-plot of an image.
No floating point arrays. Double precision.
Short integer image array.
Sspienr pi:
-----------
Calculates pi to many decimal places.
FFT type multiplication (Numerical Recipes).
Medium sized double precision array.
Medium sized short integer arrays.
A version with a faster FFT is available on the web-page:
http://www.spaennare.se/ssprog.html
Sspienr gs:
-----------
Calculates the golden section to many decimal places.
FFT type multiplication (Numerical Recipes).
Large double precision array.
Large short integer arrays.
Ssef:
-----
Calculates e = exp(1) to many decimal places.
Double precision type division.
Large integer arrays.
-----------------------------------------------------------
End of readme.txt file.