Fortran Benchmarks

Thinkpad, Pentium-120 Mandelbrot Set 23
Thinkpad, Pentium-120 Large Matrix Multiplication 3269
Thinkpad, Pentium-120 Ideal Bootstrap 0.43
M40, Risc6000 Mandelbrot Set 35
M40, Risc6000 Large Matrix Multiplication 1755
M40, Risc6000 Ideal Bootstrap 0.62

Three benchmark computations are described and code is available below. The first two were given by Eddy (1991). The last one is my own.

Mandelbrot Set

The Mandelbrot set is computed with a 512 by 512 pixel resolution. See mset.for.

Large Matrix Multiplication

Two random matrices of order 1024 by 1024 are multiplied. Over one billion floating point multiplications and additions plus extensive array indexing. See matmul.for.

Ideal Bootstrap Computation

We solve Problem 6.10 of Hastie & Tibshirani (1993). See prob610.for.


bulletEddy W.F. (1990), The DECstation 3100 - UNIX for Power Users. Chance, Volume 3, Number 2, pp.42-47
bulletEfron, B. & Tibshirani, R. (1993), Introduction to the Bootstrap. Chapman and Hall.