Head-First Memory Allocation on Best-Fit with Space-Fitting
Adam Noto Hakarsa

TL;DR
This paper introduces a memory allocation method that optimizes space utilization and significantly speeds up best-fit allocation by maintaining free regions at the top of memory, reducing fragmentation.
Contribution
It proposes a novel approach to best-fit memory allocation that improves speed and minimizes fragmentation by managing free regions at the top of memory.
Findings
34.86% faster allocation and deallocation
Maintains minimal external fragmentation
Optimizes memory space utilization
Abstract
Although best-fit is known to be slow, it excels at optimizing memory space utilization. Interestingly, by keeping the free memory region at the top of the memory, the process of memory allocation and deallocation becomes approximately 34.86% faster while also maintaining external fragmentation at minimum.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Advanced Memory and Neural Computing · Advanced Data Storage Technologies
