On Sun, Apr 13, 2008 at 06:57:26PM +0100, Nuno 'smash' Carvalho wrote: > Greetings all, > > 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 left a comment on the use.perl post as well, but is there an easy way we could look at the sources being used for the benchmarks -- i.e., if we wanted to duplicate the results on our systems? Pm
