[Date Prev][Date Next][Thread Prev][Thread Next]
- Subject: Re: New LuaJIT benchmark results (was Re: [ANN] LuaJIT-2.0.0-beta3)
- From: Geoff Leyland <geoff_leyland@...>
- Date: Wed, 10 Mar 2010 09:52:49 +1300
On 10/03/2010, at 7:51 AM, Mike Pall wrote:
> I wrote:
>> This is the third beta release of LuaJIT 2.0.0.
> The cross-language benchmark shootout results have been updated
> for beta3 (thanks Isaac!):
> Ok, so Java received a grace period ... until the next beta. :-)
Given that you said
> This release includes many fixes and performance enhancements,
> e.g. for recursive code
what's the story with the binary-trees benchmark? Is it a GC thing, a recursive thing or is it a bad benchmark?
-joff makes it a bit slower, and collectgarbage("stop") at the top (for instances that fit in memory) make it a bit faster, but neither's a huge difference.
On the other hand, since the shootout appears to judge on the median, it's probably knucleotide you want to make faster.