Hi, I was reading this article http://www.codeproject.com/tips/optimizationenemy.asp
where Joseph M. Newcomer says that
Back in the early days of C, the C storage allocator was one of the worst-performing storage allocators in existence. It was “first fit”, which meant that the way it worked was the allocator went traipsing down the free list, looking for a block at least as big as the one requested, and if it found one, it split it and returned the residue to the free list. This had the advantages of being as slow as possible and fragmenting memory as badly as possible. In fact, it was worse than you can imagine. It actually walked the list of all blocks of storage, free and allocated, and had to ignore the allocated blocks. So as you got more and more blocks, its performance degraded, and as the blocks got too small to be usable, they simply added to the overhead without adding to the value.
and
if you use the brain-dead Unix allocator, you’re bound to have performance problems. A decent storage allocator makes this a non-issue
I use this kind of memory allocator for VAR, is there a good open source memory allocator available ? What are you using to manage VAR memory ?
Does anyone ported one of these mem manager to VAR ? http://www.cs.colorado.edu/~zorn/Malloc.html