Bundling linked data structures for linearizable range queries

Nelson-Slivon, Jacob; Hassan, Ahmed; Palmieri, Roberto

doi:10.1145/3503221.3508412

Cited by 6 publications

(3 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We evaluate TL4x and compare its performance to state of the art persistent transactional memory frameworks, keyvalue stores, and volatile data structures specialized for range queries. We use the Yahoo cloud service benchmark (YCSB) and DB-bench (from RocksDB) for comparing TL4x with other PTMs and key-value stores, and benchmark introduced by Arbel-Raviv and Brown [2,41] for range-queries.…”

Section: Discussionmentioning

confidence: 99%

“…We compare TL4x against a variety of volatile data structures that are specialized for range-queries, in addition to TrinityVRTL2 PTM [46]. We apply our PTM to a skip list, a relaxed AVL tree (RAVL), and a zip tree (sequential data structures) and compare them to a skip list, binary search tree, and a citrus tree (concurrent data structures), which have been enhanced to support range queries using techniques like versioned CAS (vCAS) [55] and bundled references [41]. These two techniques make use of multi-versioning to support linearizable snapshot reads.…”

Section: Workloads and Compared Systemsmentioning

confidence: 99%

See 1 more Smart Citation

TL4x

Assa

Correia

Ramalhete³

et al. 2023

Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

The arrival of persistent memory devices to consumer market has revived the interest in transactional durable algorithms. Persistent memory (PM) is touted as having two attributes that distinguish it from other storage technologies: byteaddressability and fast transactional persistence.In this work we investigate how these attributes differentiate PM from block storage in the context of buffered durability. We present a novel algorithm, TL4x, capable of providing buffered durable linearizable transactions with high scalability for disjoint writes and efficient persistence on either PM or block storage devices. TL4x is a softwareonly user-space solution that optimizes writes to persistent storage, providing buffered durable transactions whose cost is negligible compared to similar non-durable transactions. TL4x maintains a volatile consistent snapshot which is used for durability and shared with irrevocable read-only transactions, allowing long range-query operations to run in parallel with write transactions. We use TL4x to implement a transactional database engine that can outperform RocksDB by an order of magnitude.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Workloads and Compared Systemsmentioning

confidence: 99%

TL4x

Assa

Correia

Ramalhete³

et al. 2023

Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

show abstract

“…There has been a great deal of work on linearizability verification [15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31][32][33][34]. However, proving linearizability of sophisticated concurrent data structures is still challenging.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Proving Linearizability Using Linearizations of Delete Operations

Wen

Peng

Song

2023

Preprint

View full text Add to dashboard Cite

Linearizability is a commonly accepted correctness criterion for concurrent data structures. Concurrent queues and stacks are among themost fundamental concurrent data structures. In this paper, we presentnecessary and sufficient conditions for proving linearizability of concurrent queues and stacks, which make use of linearizations of dequeueand pop operations. The verification conditions intuitively express the FIFO/LIFO semantics of concurrent queues/stacks and can be verified just by reasoning about the happened-before order of operations. Wehave successfully applied the proof technique to prove 9 challenging concurrent queues and stacks and optimize the TS queue. We believe thatour proof technique can be extended to the concurrent data structureswhich have the ordering requirements when their elements are removed.

show abstract