@inproceedings{59da318679b846889a289a95e868064c,
title = "Automatic memory reclamation for lock-free data structures",
abstract = "Lock-free data-structures are widely employed in practice, yet designing lock-free memory reclamation for them is notoriously difficult. In particular, all known lock-free reclamation schemes are {"}manual{"} in the sense that the developer has to specify when nodes have retired and may be reclaimed. Retiring nodes adequately is non-trivial and often requires the modification of the original lock-free algorithm. In this paper we present an automatic lock-free reclamation scheme for lock-free data-structures in the spirit of a mark-sweep garbage collection. The proposed algorithm works with any normalized lock-free algorithm and with no need for the programmer to retire nodes or make changes to the algorithm. Evaluation of the proposed scheme on a linked-list and a hash table shows that it performs similarly to the best manual (lock-free) memory reclamation scheme.",
keywords = "Concurrent Data Structures, Hazard Pointers, Lock-free, Memory Management, Non-blocking",
author = "Nachshon Cohen and Erez Petrank",
note = "Publisher Copyright: {\textcopyright} 2015 ACM.; 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015 ; Conference date: 25-10-2015 Through 30-10-2015",
year = "2015",
month = oct,
day = "23",
doi = "https://doi.org/10.1145/2814270.2814298",
language = "الإنجليزيّة",
series = "Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA",
pages = "260--279",
editor = "Patrick Eugster and Jonathan Aldrich",
booktitle = "OOPSLA 2015 - Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming Systems, Languages, and Applications",
}