Fast Bitmap Fit: A CPU Cache Line friendly memory allocator for single object allocations
Dhruv Matani, Gaurav Menghani

TL;DR
This paper introduces Fast Bitmap Fit, a CPU cache line friendly memory allocator designed to improve the efficiency of single-object data structures by enhancing memory locality and cache utilization.
Contribution
The paper proposes a novel memory allocator that maintains memory locality for single-object allocations, reducing cache misses and improving performance.
Findings
Reduces cache misses in single-object data structures
Improves application performance through better memory locality
Demonstrates effectiveness on CPU cache levels
Abstract
Applications making excessive use of single-object based data structures (such as linked lists, trees, etc...) can see a drop in efficiency over a period of time due to the randomization of nodes in memory. This slow down is due to the ineffective use of the CPU's L1/L2 cache. We present a novel approach for mitigating this by presenting the design of a single-object memory allocator that preserves memory locality across randomly ordered memory allocations and deallocations.
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
TopicsAdvanced Database Systems and Queries · Distributed systems and fault tolerance · Algorithms and Data Compression
