Tables show relative performance, with the actual time for the fastest run shown on the left. So, by default, 1 is the fastest, but select any implementation to normalize the table with - respect to that implementation's speed.
+ respect to that implementation's speed. A -- appears when a benchmark + didn't run in an implementation (and you should assume a benchmark problem, + rather than an implementation problem).Small gray numbers are (relative) compile times.
@@ -34,10 +36,11 @@ changed. Such assumptions correspond to putting the benchmark in an R6RS library (we expect).In general, we attempt to use the various implementations in a compentent way, - but not in a sophisticated way (which might involve, for example, tweaking an - inlining parameter or specifying fixnum arithmetic).
+ but not in a sophisticated way. For example, we do not tweak + inlining parameters or specify fixnum arithmetic (where appropriate), + which could produce significant improvements from some compilers. -For a larger set of benchmarks and a more sophisticated use of compilers, +
For a larger set of benchmarks and a more sophisticated use of the compilers, see Marc Feeley's page: http://www.iro.umontreal.ca/~gambit/bench.html. @@ -47,7 +50,7 @@ R6RS library (we expect).
http://svn.plt-scheme.org/plt/trunk/collects/tests/mzscheme/benchmarks/common/
-