27 ms·
It would be interesting to see a performance comparison with nedmalloc. It uses a trie instead a of redblack-tree for a faster information access. http://www.n
by amadvance 16y ago
It would be interesting to see a performance comparison with nedmalloc. It uses a trie instead a of redblack-tree for a faster information access.
http://www.nedprod.com/programs/portable/nedmalloc/ http://www.nedprod.com/programs/portable/nedmalloc/
Some time ago I evaluated both of them, and they seemed the best available choices. But I never found a comparison study.
- agazso 16y agoIt is not a performance evaluation, but there is a comment from Niall (the author of nedmalloc) in Jason Evans' blog that might give you a hint. http://t-t-travails.blogspot.com/2010/04/red-black-trees-revisited.html http://t-t-travails.blogspot.com/2010/04/red-black-trees-rev...
- jasone 16y agoI tried to include nedmalloc 1.0.5 in the benchmark, but it quite simply isn't polished enough for actual use. To start with I had to remove an invalid assertion in malloc() and implement posix_memalign(), only to find that it crashes within moments of application startup.