(Chez) Scheme benchmarks?

Question

Now that Chez Scheme is open-source, I wonder how it compares to Racket and other Schemes or languages in terms of performance, so that one could make informed choices about using them in one's projects.

Unfortunately, I couldn't find any relevant benchmarks.

I found the following:

---

https://ecraven.github.io/r7rs-benchmarks/benchmark.html

Problem: no Racket, or other languages (Update 10/13/18: Chez is now included in some of the benchmarks)

---

http://www.larcenists.org/benchmarksGenuineR6Linux.html

Problem: no Chez Scheme, or other languages

---

https://benchmarksgame-team.pages.debian.net/benchmarksgame/

Problem: only Racket, questionable comparisions (For example, Python is not allowed to use Numpy where it would clearly help, while Racket is making FFI calls to GMP)

---

So, none of the benchmarks I found allow you to compare Racket to Chez, for example, or Chez to SBCL, or Java. Are there Chez benchmarks that give you a sense of how fast it is?

Chez Scheme is often said to be the fastest Scheme/Lisp around. We should know if it's faster than, say, Java for your typical business logic application.

Answer 1

Kent Dybvig has written articles on the implementation Chez Scheme. They'll often have comparisons with other implementations:

https://www.cs.indiana.edu/~dyb/

Answer 2

It's anecdotal, but Matthew Flatt, the lead developer of Racket, thinks Chez is pretty good. You can read more about it here. He cites a regular expression matcher in which Chez is twice as fast as Racket and comparable to C.