views:

83

answers:

1

Where are some good resources for looking at the pros/cons of different ways of implementing heap allocators? Resources touching on efficiency (fragmentation, throughput, etc) are preferred. I am NOT looking for simple code repositories.

edit:

I'm not really interested in the philosophical grounding of this wiki. As such, I don't really want to get into 'why' I'm interested in this. Regardless of the underlying intentions/problems/etc, this information exists, so if you know of any good resources, please link to them here!

+4  A: 
Norman Ramsey
how well respected is doug lea's implementation? with the user of header and footer blocks for size of used blocks, and further pointer information for free blocks? has this strategy resulted in a good balance between fragmentation and time to service requests?
hatorade
also, is the first version of "The Art of Programming" available free on that website? i can't find a copy.
hatorade
@hatorade: Knuth is worth buying.
Jonathan Leffler
@hatorade: Lea's allocator is *highly* respected, and Don isn't likely to give away his life's work for free. He's retired from Stanford and book royalties are his income.
Norman Ramsey