LRMalloc: a Modern and Competitive Lock-Free Dynamic Memory Allocator

Ricardo Leite and Ricardo Rocha

September 2018

---

Abstract

This paper presents LRMalloc, a lock-free memory allocator that leverages lessons of modern memory allocators and combines them with a lock-free scheme. Current state-of-the-art memory allocators possess good performance but lack desirable lock-free properties, such as, priority inversion tolerance, kill-tolerance availability, and/or deadlock and livelock immunity. LRMalloc's purpose is to show the feasibility of lock-free memory management algorithms, without sacrificing competitiveness in comparison to commonly used state-of-the-art memory allocators, especially for concurrent multithreaded applications.

Bibtex

@InProceedings{leite-vecpar18,
  author =    {R. Leite and R. Rocha},
  title =     {{LRMalloc: a Modern and Competitive Lock-Free Dynamic Memory Allocator}},
  booktitle = {Proceedings of the 13th International Meeting on High Performance Computing
               for Computational Science (VECPAR 2018)},
  pages =     {230--243},
  number =    {11333},
  series =    {LNCS},
  publisher = {Springer},
  editor =    {H. Senger and R. Iope and T. Pinheiro and O. Marques and S. Stanzani
               and I. Dutra and V. Gil-Costa},
  month =     {September},
  year =      {2018},
  address =   {São Pedro, São Paulo, Brazil},
}

Download Paper

PDF file
Springer