Vmalloc: A General and Efficient Memory Allocator
- 1 March 1996
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 26 (3), 357-374
- https://doi.org/10.1002/(sici)1097-024x(199603)26:3<357::aid-spe15>3.0.co;2-#
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Evaluating models of memory allocationACM Transactions on Modeling and Computer Simulation, 1994
- Customalloc: Efficient synthesized memory allocatorsSoftware: Practice and Experience, 1993
- Empirical measurements of six allocation-intensive C programsACM SIGPLAN Notices, 1992
- Garbage collection in an uncooperative environmentSoftware: Practice and Experience, 1988
- Self-adjusting binary search treesJournal of the ACM, 1985
- New methods for dynamic storage allocation (Fast Fits)ACM SIGOPS Operating Systems Review, 1983
- A unifying look at data structuresCommunications of the ACM, 1980
- Worst case fragmentation of first fit and best fit storage allocation strategiesThe Computer Journal, 1977
- On the external storage fragmentation produced by first-fit and best-fit allocation strategiesCommunications of the ACM, 1975
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974