There’s this benchmark on BF interpreter where the Racket <https://github.com/kostya/benchmarks/blob/master/brainfuck/bf.rkt> and Chez Scheme <https://github.com/kostya/benchmarks/blob/master/brainfuck/bf.ss> implementations are very similar, but Chez Scheme is much faster than Racket 8.0 at interpreting bench.b <https://github.com/kostya/benchmarks#benchb> (3s vs 8s) and mandel.b <https://github.com/kostya/benchmarks#mandelb> (40s vs 136s).
There’s the “Racket (Syntax Object) <https://github.com/kostya/benchmarks/blob/master/brainfuck/bf-syntax.rkt#L75>” variant that directly parses BF’s syntax into Racket syntax object, which is faster (3.7s for bench, 82s for mandel), but still significantly behind Chez Scheme’s naive interpreter. Profiling doesn’t give very illuminating results, saying most of the cost is from interpreting BF’s loop instruction. Given that Racket is on Chez, could this benchmark reveal some low hanging fruit for improving Racket’s performance? -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/83b2819d-8295-4769-944d-fa0c155976dan%40googlegroups.com.
