GC statistics (was Re: big project ported)

[Godmar Back]

Hans,

latte and SRCJava use an allocation scheme where small objects are
allocated contigously within a page.  This reduces discretization 
overhead and allows for fast allocation in the common case.

However, in order to find out whether a pointer points to the beginning 
of an object, you first have to find out whether the page contains 
small objects, and secondly you have to linearly scan through the objects
on the page until you find or miss the location you're looking for.

How would you rate such a scheme compared to a bitmap-based allocator?

	- Godmar