Name
Abstract | ||
|---|---|---|
ABSTRACTSafe lock-free memory reclamation is a difficult problem. Existing solutions follow three basic methods: 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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3409964.3461817 | ACM Symposium on Parallel Algorithms and Architectures |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gali Sheffi | 1 | 1 | 0.69 |
| Maurice Herlihy | 2 | 8623 | 920.94 |
| Erez Petrank | 3 | 1601 | 107.96 |