Concurrent tries with efficient non-blocking snapshots

Prokopec, Aleksandar; Bronson, Nathan; Bagwell, Phil; Odersky, Martin

doi:10.1145/2145816.2145836

Cited by 75 publications

(9 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Linearizable range queries. Existing work has focused on providing range queries through highly-specific data structure implementations [5,6,9,10,43,46]. While recognizing their effectiveness, their tight dependency on the data structure characteristics makes them difficult to extend to other structures, even if manually.…”

Section: Related Workmentioning

confidence: 99%

Technical Report: Bundling Linked Data Structures for Linearizable Range Queries

Nelson-Slivon¹,

Hassan²,

Palmieri³

2022

Preprint

View full text Add to dashboard Cite

We present bundled references, a new building block to provide linearizable range query operations for highly concurrent lock-based linked data structures. Bundled references allow range queries to traverse a path through the data structure that is consistent with the target atomic snapshot. We demonstrate our technique with three data structures: a linked list, skip list, and a binary search tree. Our evaluation reveals that in mixed workloads, our design can improve upon the state-of-the-art techniques by 1.2x-1.8x for a skip list and 1.3x-3.7x for a binary search tree. We also integrate our bundled data structure into the DBx1000 in-memory database, yielding up to 40% gain over the same competitors.

show abstract

Section: Related Workmentioning

confidence: 99%

Technical Report: Bundling Linked Data Structures for Linearizable Range Queries

Nelson-Slivon¹,

Hassan²,

Palmieri³

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…To demonstrate a concrete instantiation of the hybrid data structure, we built a hybrid that converts a Ctrie [Prokopec et al 2012] to a purely functional hashmap. We use our implementation of freezable IORefs from Appendix B for all the mutable memory locations inside the CTrie data structure.…”

Section: Example Adaptive Data Structurementioning

confidence: 99%

“…Our formal model uses an abstract machine that models clients interacting with a lock free data structure. • We demonstrate how to apply the method in a Haskell library that transitions between a concurrent Ctrie [Prokopec et al 2012] and a purely functional hashmap ( § 7.1). We perform a case study measuring the benefit of transitioning from a concurrent data structure to a representation optimized for read-heavy workloads ( § 8).…”

Section: Introductionmentioning

confidence: 99%

Adaptive lock-free data structures in Haskell: a general method for concurrent implementation swapping

Chen

Choudhury

Newton

2017

Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell

View full text Add to dashboard Cite

A key part of implementing high-level languages is providing builtin and default data structures. Yet selecting good defaults is hard. A mutable data structure's workload is not known in advance, and it may shift over its lifetime-e.g., between read-heavy and writeheavy, or from heavy contention by multiple threads to singlethreaded or low-frequency use. One idea is to switch implementations adaptively, but it is nontrivial to switch the implementation of a concurrent data structure at runtime. Performing the transition requires a concurrent snapshot of data structure contents, which normally demands special engineering in the data structure's design. However, in this paper we identify and formalize an relevant property of lock-free algorithms. Namely, lock-freedom is sufficient to guarantee that freezing memory locations in an arbitrary order will result in a valid snapshot.Several functional languages have data structures that freeze and thaw, transitioning between mutable and immutable, such as Haskell vectors and Clojure transients, but these enable only single-threaded writers. We generalize this approach to augment an arbitrary lock-free data structure with the ability to gradually freeze and optionally transition to a new representation. This augmentation doesn't require changing the algorithm or code for the data structure, only replacing its datatype for mutable references with a freezable variant. In this paper, we present an algorithm for lifting plain to adaptive data and prove that the resulting hybrid data structure is itself lock-free, linearizable, and simulates the original. We also perform an empirical case study in the context of heating up and cooling down concurrent maps.

show abstract

“…Refer to the README, therewithin for info 2 Related Work Linearizable range queries. Existing work has focused on providing range queries through highly-specific data structure implementations [4,5,8,9,36,38]. While recognizing their effectiveness, their tight dependency on the data structure characteristics makes them difficult to extend to other structures, even if manually.…”

Section: Introductionmentioning

confidence: 99%

Bundled References: An Abstraction for Highly-Concurrent Linearizable Range Queries

Nelson¹,

Hassan²,

Palmieri³

2020

Preprint

View full text Add to dashboard Cite

We present bundled references, a new building block to provide linearizable range query operations for highly concurrent linked data structures. Bundled references allow range queries to traverse a path through the data structure that is consistent with the target atomic snapshot and is made of the minimal amount of nodes that should be accessed to preserve linearizability. We implement our technique into a skip list, a binary search tree, and a linked list data structure. Our evaluation reveals that in mixed workloads, our design improves upon the state-of-the-art techniques by 3.9x for a skip list and 2.1x for a binary search tree. We also integrate our bundled data structure into the DBx1000 in-memory database, yielding up to 20% gain over the same competitors.

show abstract

Concurrent tries with efficient non-blocking snapshots

Cited by 75 publications

References 14 publications

Technical Report: Bundling Linked Data Structures for Linearizable Range Queries

Technical Report: Bundling Linked Data Structures for Linearizable Range Queries

Adaptive lock-free data structures in Haskell: a general method for concurrent implementation swapping

Bundled References: An Abstraction for Highly-Concurrent Linearizable Range Queries

Contact Info

Product

Resources

About