[Date Prev][Date Next][Thread Prev][Thread Next]
- Subject: Re: Binarytrees benchmark results
- From: Francesco Abbate <gslshell@...>
- Date: Mon, 7 Dec 2009 16:09:34 +0100
2009/12/7 Mike Pall <firstname.lastname@example.org>:
> Luís Eduardo Jason Santos wrote:
>> Does anyone knows why the binarytrees benchmark on  doesn't have the
>> usual 'killing machine' performance one could expect from Lua?
> All the other language implementations either use a bump allocator
> with a generational GC or a dedicated pool allocator.
Actually I'm the owner of the fastest program, written in C :-) and it
does use the pool allocator from the APR (apache portable runtime).
In my opinion this test is one of the least interesting since it is
mainly a test of the allocator, so I would not give it so much