A study of best-fit memory allocators

Dynamic memory allocation often makes up a large part of program execution time. Different variants of the best-fit allocator are implemented and their space and time costs measured and compared. We found variants of this algorithm that are 3-33% faster than the Doug Lea 2.7.0 allocator.