Fast Bitmap Fit: A CPU Cache Line friendly memory allocator for single object allocations

10/20/2021
by   Dhruv Matani, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset