On Sunday 13 April 2008 10:57:26 Nuno 'smash' Carvalho wrote:
> We did another Parrot benchmarking, this time using a common
> programming technique: recursion. We created a function to calculate
> the number of nodes in a full binary tree given the tree's height. I
> guess this time the results where not so satisfactory, for Parrot. You
> can see the details here: http://use.perl.org/~smash/journal/36140
I appreciate the work you're doing, but I suspect that that graph is
completely unreadable to the colorblind. All that I can tell is what I
already knew -- Ruby is slow. Increasing the size of the graph by 4 or 5
times might help. (Choosing different colors and line styles would help
more.)
As well, the optimizations I recommend for Parrot (if you want to use
optimization flags) are:
-O2, to choose the fastest available runcore
-Op, to rewrite registers for faster access
-Oc, to use tail-call optimizations
If they're stable (and they're not always perfectly stable), -Oc should
improve the recursion benchmark.
-- c
