The second set is why I started running benchmarks. Fixnum-/flonum-specific arithmetic and unsafe operations are new in PLT Scheme 4.2.4. The benchmark results suggest that the new operations in PLT Scheme offer roughly the same performance benefits as in Bigloo and Gambit. There's room for improvement, but it's a good first cut.
For the other results: PLT Scheme is rarely the fastest implementation on a given benchmark. For most purposes, though, it's in the same ballpark – except for programs that spend all their time capturing and invoking continuations.
It's fun to run benchmarks occasionally. Now, back to working on language design, libraries, documentation, usability...

I don't think that compilation time is included, since run time is measured within the program using `(times)'. Also, clearing out the cache before running doesn't seem to give different results than running a second time.