From 066b4386e42f88f8de086548e9fd598297456900 Mon Sep 17 00:00:00 2001
From: Matthew Flatt The pages linked below show some benchmark results on a collection of fairly standard
+ (mostly Gabriel) Scheme benchmarks. 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. Small gray numbers are (relative) compile times. Run times are averaged over three runs. All reported times are CPU time (system plus user).
+ Where available, the times are based on the output of the implementation's time
+ syntactic form, otherwise /usr/bin/time is used. Compiler configuration:
+About the Benchmarks
+
+
+
+These configurations are all "safe mode", but they allow the compiler
+to assume that built-in Scheme functions are not redefined and (except
+in the case of Larceny) that no top-level defintion is ever
+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).
+ +For further details, consult the benchmark source and infrastructure, which is + available form the PLT SVN repository:
+ ++ http://svn.plt-scheme.org/plt/trunk/collects/tests/mzscheme/benchmarks/common/
+ +