On Sun, Dec 11, 2005 at 10:25:54PM +0100, Leopold Toetsch wrote: > > On Dec 11, 2005, at 17:01, Leopold Toetsch wrote: > > >Leopold Toetsch wrote: > > > >>I've timed Ack(3, 9) with an optimized Parrot build: > >>Python 13.7 > >>Parrot -j 15.3 > >>Parrot -C 13.8 > > > >Down now (r10445) at: > > > > parrot -C ack.pir 5.7s > > parrot -C binarytrees 16 1m14s > > ./parrot -C ack.pir 4.9s > ./parrot -C binarytrees.pir 16 59.1s > > I'm stopping the optimization game now, before we are at incredible > speed and/because the low hanging fruit is already consumed. > > All tests with Configure.pl --optimize (it doesn't make sense to run > comparable bechmarks w/o -Ox) on linux/x86 with a 2 GHz athlon w 512K > cache. > > leo >
Just curious, but why is mono at .38 seconds and 10.00 seconds respectively? What in the .NET implementation makes recursive calls so fast? Ed
