Download PDFOpen PDF in browserOn Exploring Safe Memory Reclamation Methods with a Simplified Lock-Free Hash Map DesignEasyChair Preprint 141784 pages•Date: July 26, 2024AbstractLock-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. Keyphrases: concurrent data structures, lock-freedom, memory reclamation, safe memory reclamation
|