Tuesday September 27, 2005 Big Freaking Numbers III
Remember that I talked about the different flavors of ExpressionBuilders in project BigNumbers a while ago? At this stage, there are two of them. One implementation turns the String expression into an Expression implementation that is interpreted for every evaluation. The other implementation took a different (and pretty fancy) approach by compiling the String expression into a full-fledged Java class on the fly.
Today, I did a benchmark to see which one would be more performant. The results are slightly dissapointing. I was kind of hoping that the JIT-compiling version of the ExpressionBuilder would outperform the other one, but it doesn't. *sigh* I expected the interpreter to outperform the other ExpressionBuilder in case of ad-hoc expressions, so I wasn't too surprised when that turned out to be true. However, the JIT-compiling version of the ExpressionBuilder only starts to outperform the interpreter version after 3000-4000 evaluations. And then only by microseconds.
Java Parser ( Sep 27 2005, 03:15:42 PM CEST ) Permalink Comments [2]
Have you given SISC a go? These guys have implemented the whole scheme number set (including complex, rationals, exact and inexact arithmetic). They claim it's the fastest Scheme interpreter around...
Well, after that Scheme is nice even for symbolic math, rigth?
All the best,
Antonio
Posted by Antonio on September 28, 2005 at 11:51 PM CEST #
Nope, haven't seen it. It looks interesting, but I'm not really a scheme programmer. (I know that sounds silly from an Emacs user...)
Project BigNumbers is a humble project: I don't have any ambitions at all, apart from making it easier to do BigDecimal calculations in Java.
Posted by Wilfred Springer on September 29, 2005 at 03:13 PM CEST #