Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2021.35
URN: urn:nbn:de:0030-drops-148374
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14837/
Sheffi, Gali ; Herlihy, Maurice ; Petrank, Erez
VBR: Version Based Reclamation
| pdf-format: |
|
Abstract
Safe lock-free memory reclamation is a difficult problem. Existing solutions follow three basic methods (or their combinations): epoch based reclamation, hazard pointers, and optimistic reclamation. Epoch-based methods are fast, but do not guarantee lock-freedom. Hazard pointer solutions are lock-free but typically do not provide high performance. Optimistic methods are lock-free and fast, but previous optimistic methods did not go all the way. While reads were executed optimistically, writes were protected by hazard pointers. In this work we present a new reclamation scheme called version based reclamation (VBR), which provides a full optimistic solution to lock-free memory reclamation, obtaining lock-freedom and high efficiency. Speculative execution is known as a fundamental tool for improving performance in various areas of computer science, and indeed evaluation with a lock-free linked-list, hash-table and skip-list shows that VBR outperforms state-of-the-art existing solutions.
BibTeX - Entry
@InProceedings{sheffi_et_al:LIPIcs.DISC.2021.35,
author = {Sheffi, Gali and Herlihy, Maurice and Petrank, Erez},
title = {{VBR: Version Based Reclamation}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {35:1--35:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14837},
URN = {urn:nbn:de:0030-drops-148374},
doi = {10.4230/LIPIcs.DISC.2021.35},
annote = {Keywords: Safe memory reclamation, concurrency, linearizability, lock-freedom}
}
| Keywords: | Safe memory reclamation, concurrency, linearizability, lock-freedom | |
| Seminar: | 35th International Symposium on Distributed Computing (DISC 2021) | |
| Issue date: | 2021 | |
| Date of publication: | 04.10.2021 |
