Vmalloc: A General and Efficient Memory Allocator
Kiem-Phong Vo · Software Practice and Experience · 1996
Despite its popularity, malloc's shortcomings frequently cause programmers to code around it. The new library Vmalloc generalizes malloc to give programmers more control over memory allocation. Vmalloc introduces the idea of organizing memory into separate regions, each with a discipline to get raw memory and a method to manage allocation. Applications can write their own disciplines to manipulate arbitrary type of memory or just to better organize memory in a region by creating new regions out of its memory. The provided set of allocation methods include general purpose allocation, fast special cases and aids for memory debugging or profiling. A compatible malloc interface enables current applications to select allocation methods using environment variables so they can tune for performance or perform other tasks such as profiling memory usage, generating traces of allocation calls or debugging memory errors. A performance study comparing Vmalloc and currently popular malloc implementations shows that Vmalloc is competitive to the best of these allocators. Applications can gain further performance improvement by using the right mixture of regions with different Vmalloc methods.
Cited by 75 works. doi:10.1002/(sici)1097-024x(199603)26:3<357::aid-spe15>3.0.co;2-#
Authors
References
- The Art of Computer Programming
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Self-adjusting binary search trees
- Garbage collection in an uncooperative environment
- A unifying look at data structures
- Daytona and the fourth-generation language Cymbal
- Ciao: a graphical navigator for software and document repositories
- The average-case analysis of some on-line algorithms for bin packing
- Customalloc: Efficient synthesized memory allocators
- New methods for dynamic storage allocation (Fast Fits)