[Date Prev][Date Next][Thread Prev][Thread Next]
- Subject: Re: New LuaJIT benchmark results (was Re: [ANN] LuaJIT-2.0.0-beta3)
- From: Mike Pall <mikelu-1003@...>
- Date: Tue, 9 Mar 2010 23:48:00 +0100
Peter Cawley wrote:
> On Tue, Mar 9, 2010 at 10:02 PM, Mike Pall <firstname.lastname@example.org> wrote:
> >> what's the story with the binary-trees benchmark? Is it a GC
> >> thing, a recursive thing or is it a bad benchmark?
> > It's mainly a GC benchmark and only incidentally uses recursion.
> Is it acceptable to use to inside-out structures strategy for the
> benchmark, and hence implement each object as entries in three tables,
> rather than each object being a table containing three entries?
Nope. The idea is to be able to compare different languages using
the same algorithms and the same approach.