Hacker News new | comments | show | ask | jobs | submit login
Scheme benchmarking with a meta-circular interpreter (yinwang0.wordpress.com)
25 points by soegaard 1258 days ago | hide | past | web | 9 comments | favorite



This benchmark is missing Chicken Scheme: http://www.call-cc.org/




No Gambit-C? That's why Racket is a winner.)

There is also Bigloo and MIT Scheme (which is able to produce native code).


I wonder how much of Racket's improvement over time really has to do with underlying changed to GNU Lightening (the library that underpins its JITing). Also, the interpreter and benchmarks look like they inherently single-threaded, so even though the server hardware looks beefy compared to the MacBook, it's really only using one of thoses (probably slower) cores. There are Scheme and CL implementations that make it easier to write code that parallelizes easier than is possible in Racket -- so anything beyond simple apples-to-apples code like this benchmark would show very different results.


> As we know, in comparison to compilers, interpreters have “interpretive overhead” when they execute programs. What if you run the interpreter itself inside a copy of itself? The overhead roughly multiplies.

Wouldn't benchmarking this factor be more interesting than just benchmarking multiple compilers for a a fixed n levels of interpretation-recursion?


I’d like to see a table, with the different compilers and the different levels of interpretations: 0 interpretations, 1 interpretations, ..., 5 interpretations


Faster than Clozure Common Lisp? That just itches my skeptic button.


Dunno about Clozure, but I just ran it in SBCL (had it open anyway), it took 11.256 seconds (5.17s of GC) on my old Intel Q6600 (7 years old now). Makes it seem that there might be something strange about the Clozure benchmark, although I generally think of SBCL as one of the faster Lisps.




Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | DMCA | Apply to YC | Contact

Search: