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.
@article{arxiv.2110.10357,
title = {Fast Bitmap Fit: A CPU Cache Line friendly memory allocator for single object allocations},
author = {Dhruv Matani and Gaurav Menghani},
journal= {arXiv preprint arXiv:2110.10357},
year = {2021}
}