÷

 Step 1 : Are the programs faster? At a glance.

This chart shows 3 comparisons - Time-used, Memory-used and Code-used.

Each chart bar shows, for one unidentified benchmark, how much the fastest program used compared to the fastest program.


 Step 2 : Are the programs faster? Approximately.

This table shows 3 comparisons - Time-used, Memory-used and Code-used.

Each table row shows, for one named benchmark, how much the fastest program used compared to the fastest program.

  used what fraction? used how many times more? 
Benchmark Time Memory Code Reduced N

± read the measurements and then read the program source code.

 Step 3 : Are the programs faster? Measurements.

This table shows 5 measurements - CPU Time, Elapsed Time, Memory, Code and ~ CPU Load.

For each named benchmark, measurements of the fastest program are shown for comparison against measurements of the fastest program.

Program Source Code CPU secs Elapsed secs Memory KB Code B ~ CPU Load
 binary-trees
   No program
 chameneos-redux
   No program
 fannkuch
   No program
 fasta
   No program
 k-nucleotide
   No program
 mandelbrot
   No program
 n-body
   No program
 nsieve
   No program
 nsieve-bits
   No program
 partial-sums
   No program
 pidigits
   No program
 recursive
   No program
 regex-dna
   No program
 reverse-complement
   No program
 spectral-norm
   No program
 sum-file
   No program

 Measurements for all the accepted programs

  :  

Intel Fortran Compiler Version Intel(R) Fortran Compiler for 32-bit applications, Version 9.0 Build 20050430Z Package ID: Copyright (C) 1985-2005 Intel Corporation. All rights reserved. FOR NON-COMMERCIAL USE ONLY ifort: Command line error: no files specified; for help type "ifort -help"

Home Page: Non-Commercial Software Development

Revised BSD license