Warp wrote:
> tends to happen when you just keep a list of freed objects without ever

Have you ever tried building one that uses a bitmap of free entries? Since 
they're all the same size, it would seem easy to do all the math needed quickly.

>   According to my tests this can have such a big impact that even spending
> time sorting freed objects can speed up memory allocation overall. Cache
> misses simply are really expensive.

That's probably another reason the performance of compacting GCs are often 
better than "manual" malloc and free.

-- 
   Darren New, San Diego CA, USA (PST)
   There's no CD like OCD, there's no CD I knoooow!

Post a reply to this message