VBR: Version Based Reclamation

TL;DR

VBR introduces a fully optimistic, lock-free memory reclamation scheme that outperforms existing methods in lock-free data structures by combining high efficiency with lock-freedom.

Contribution

The paper presents VBR, a novel optimistic reclamation scheme that achieves lock-freedom and high performance, surpassing existing epoch-based, hazard pointer, and previous optimistic methods.

Findings

VBR outperforms state-of-the-art solutions in benchmarks.

VBR provides lock-freedom and high efficiency.

Evaluation on linked-list, hash-table, and skip-list shows significant improvements.

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.