Miguel Areias

On Exploring Safe Memory Reclamation Methods with a Simplified Lock-Free Hash Map Design

Abstract

Lock-freedom offers significant advantages in terms of algorithm design, performance and scalability. A fundamental building block in software development is the usage of hash map data structures. This work extends a previous lock-free hash map to support a new simplified design that is able to take advantage of most state-of-the-art safe memory reclamation methods, thus outperforming the previous design.

Bibtex

@InProceedings{moreno-europar25,
  author =    {P. Moreno and M. Areias and R. Rocha},
  title =     {{On Exploring Safe Memory Reclamation Methods with a Simplified
                Lock-Free Hash Map Design}},
  booktitle = {Euro-Par 2024: Parallel Processing Workshops}, 
  pages =     {302--306},
  series =    {LNCS},  
  publisher = {Springer Nature Switzerland},
  editor =    {Caino-Lores, Silvina and Zeinalipour, Demetris and Doudali, Thaleia Dimitra
               and Singh, David E. and Garzón, Gracia Ester Martín and Sousa, Leonel
               and Andrade, Diego and Cucinotta, Tommaso and D'Ambrosio, Donato and Diehl, Patrick
               and Dolz, Manuel F. and Jukan, Admela and Montella, Raffaele and Nardelli, Matteo
               and Garcia-Gasulla, Marta and Neuwirth, Sarah},
  month =     {June},
  year =      {2025}
}

Download Paper/Poster

Paper (in pdf)
Poster (in pdf)
Springer (Paper)