Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries

Fatourou, Panagiota; Papavasileiou, Elias; Ruppert, Eric

doi:10.1145/3323165.3323197

Cited by 24 publications

(7 citation statements)

References 43 publications

(57 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fatourou, Papavasileiou and Ruppert [20] used multiversioning to add range queries to a search tree [18]. Wei et al [48] generalized this approach (and made it more efficient) to support wait-free queries on a large class of lock-free data structures.…”

Section: Related Workmentioning

confidence: 99%

“…Supporting multiple "historical" versions of data, often called multiversioning or multiversion concurrency control, is a powerful technique widely used in database systems [41,9,37,31,35,50], transactional memory [39,21,38,30,28], and shared data structures [7,20,34,48]. This approach allows complex queries (read-only transactions) to proceed concurrently with updates while still appearing atomic because they get data views that are consistent with a single point in time.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Space and Time Bounded Multiversion Garbage Collection

Ben-David,

Blelloch,

Fatourou

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

We present a general technique for garbage collecting old versions for multiversion concurrency control that simultaneously achieves good time and space complexity. Our technique takes only O(1) time on average to reclaim each version and maintains only a constant factor more versions than needed (plus an additive term). It is designed for multiversion schemes using version lists, which are the most common.Our approach uses two components that are of independent interest. First, we define a novel rangetracking data structure which stores a set of old versions and efficiently finds those that are no longer needed. We provide a wait-free implementation in which all operations take amortized constant time. Second, we represent version lists using a new lock-free doubly-linked list algorithm that supports efficient (amortized constant time) removals given a pointer to any node in the list. These two components naturally fit together to solve the multiversion garbage collection problem-the range-tracker identifies which versions to remove and our list algorithm can then be used to remove them from their version lists. We apply our garbage collection technique to generate end-to-end time and space bounds for the multiversioning system of Wei et al. (PPoPP 2021).

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Space and Time Bounded Multiversion Garbage Collection

Ben-David,

Blelloch,

Fatourou

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, they are not work-efficient, requiring O(m log n) work. There is also previous work focusing on I/O efficiency [15] and concurrent operations [37,57] for parallel trees, and parallel data structures supporting batches [4,64,78]. Some previous algorithms achieve optimal work and polylogarithmic span.…”

Section: Background and Related Workmentioning

confidence: 99%

Optimal Parallel Algorithms in the Binary-Forking Model

Blelloch

Fineman

et al. 2020

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

In this paper we develop optimal algorithms in the binary-forking model for a variety of fundamental problems, including sorting, semisorting, list ranking, tree contraction, range minima, and ordered set union, intersection and difference. In the binary-forking model, tasks can only fork into two child tasks, but can do so recursively and asynchronously. The tasks share memory, supporting reads, writes and test-and-sets. Costs are measured in terms of work (total number of instructions), and span (longest dependence chain).The binary-forking model is meant to capture both algorithm performance and algorithm-design considerations on many existing multithreaded languages, which are also asynchronous and rely on binary forks either explicitly or under the covers. In contrast to the widely studied PRAM model, it does not assume arbitrary-way forks nor synchronous operations, both of which are hard to implement in modern hardware. While optimal PRAM algorithms are known for the problems studied herein, it turns out that arbitrary-way forking and strict synchronization are powerful, if unrealistic, capabilities. Natural simulations of these PRAM algorithms in the binary-forking model (i.e., implementations in existing parallel languages) incur an Ω(log n) overhead in span. This paper explores techniques for designing optimal algorithms when limited to binary forking and assuming asynchrony. All algorithms described in this paper are the first algorithms with optimal work and span in the binary-forking model. Most of the algorithms are simple. Many are randomized.

show abstract

“…This may also require the programmer to reprove the data structure's progress guarantees [11]. Additionally, it is not clear how HPs could be used with data structures that allow threads to traverse pointers in unlinked records [11], and there are many examples of such data structures, e.g., [1,8,10,19,21,23,27,31,32,34] [opposing P5]. (In such data structures, a search can potentially pass through many unlinked records, and yet end up back in the data structure, at the appropriate location.…”

Section: Related Workmentioning

confidence: 99%

NBR: Neutralization Based Reclamation

Singh¹,

Brown²,

Mashtizadeh³

2020

Preprint

View full text Add to dashboard Cite

Safe memory reclamation (SMR) algorithms suffer from a trade-off between bounding unreclaimed memory and the speed of reclamation. Hazard pointer (HP) based algorithms bound unreclaimed memory at all times, but tend to be slower than other approaches. Epoch based reclamation (EBR) algorithms are faster, but do not bound memory reclamation. Other algorithms follow hybrid approaches, requiring special compiler or hardware support, changes to record layouts, and/or extensive code changes. Not all SMR algorithms can be used to reclaim memory for all data structures.We propose a new neutralization based reclamation (NBR) algorithm that is faster than the best known EBR algorithms and achieves bounded unreclaimed memory. It is non-blocking when used with a non-blocking operating system (OS) kernel, and only requires atomic read, write and CAS. NBR is straightforward to use with many different data structures, and in most cases, require similar reasoning and programmer effort to two-phased locking. NBR is implemented using OS signals and a lightweight handshaking mechanism between participating threads to determine when it is safe to reclaim a record. Experiments on a lock-based binary search tree and a lazy linked list show that NBR significantly outperforms many state of the art reclamation algorithms. In the tree NBR is faster than next best algorithm, DEBRA by upto 38% and HP by upto 17%. And, in the list NBR is 15% and 243% faster than DEBRA and HP, respectively.

show abstract

Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries

Cited by 24 publications

References 43 publications

Space and Time Bounded Multiversion Garbage Collection

Space and Time Bounded Multiversion Garbage Collection

Optimal Parallel Algorithms in the Binary-Forking Model

NBR: Neutralization Based Reclamation

Contact Info

Product

Resources

About