When Chez is faster than Racket CS, the usual culprits are either: - mutable pairs - very large code size that causes Racket CS to interpret the outer module
However, neither of those seem to be happening here. Sam On Mon, Mar 1, 2021 at 2:39 AM [email protected] <[email protected]> wrote: > > There’s this benchmark on BF interpreter where the Racket and Chez Scheme > implementations are very similar, but Chez Scheme is much faster than Racket > 8.0 at interpreting bench.b (3s vs 8s) and mandel.b (40s vs 136s). > > There’s the “Racket (Syntax Object)” 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 [email protected]. > To view this discussion on the web visit > https://groups.google.com/d/msgid/racket-users/83b2819d-8295-4769-944d-fa0c155976dan%40googlegroups.com. -- 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 [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/CAK%3DHD%2BY5p%3DW2%2BMrg_QpvVQZVXY%2B3sHW-c%3DGcK1KrTT%3D0hRC9-g%40mail.gmail.com.
