Asynchronized Concurrency

David, Tudor; Guerraoui, Rachid; Trigonakis, Vasileios

doi:10.1145/2694344.2694359

Cited by 83 publications

(9 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We used a variant of EBR that uses clock vectors. In particular, we used ssmem, an EBR that accompanies the ASCYLIB algorithms [David et al 2015].…”

Section: Memory Managementmentioning

confidence: 99%

Efficient lock-free durable sets

Zuriel

Friedman

Sheffi

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures. Durable concurrent data structures for non-volatile memories are essential building blocks for constructing adequate software for use with these architectures. In this paper, we propose a new approach for durable concurrent sets and use this approach to build the most efficient durable hash tables available today. Evaluation shows a performance improvement factor of up to 3.3x over existing technology.

show abstract

“…We used a variant of EBR that uses clock vectors. In particular, we used ssmem, an EBR that accompanies the ASCYLIB algorithms [David et al 2015].…”

Section: Memory Managementmentioning

confidence: 99%

Efficient lock-free durable sets

Zuriel

Friedman

Sheffi

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…For example, if a lock-free write is interrupted by the scheduler, it might need to retry the operation after being rescheduled if the shared state has changed. To protect against starvation, many indexes use non-blocking reads and blocking, lock-protected writes [4,16,48,53].…”

Section: Concurrency and Isolationmentioning

confidence: 99%

“…The design aims at addressing the cachecoherence problem by ensuring that each update to the hash table requires one cache line access in the common case. To ensure that a non-blocking reader finds the correct value, CLHT uses atomic snapshots of key-value pairs [16,18] Non-SMOs. CLHT installs any update to the hashtable by locking the appropriate bucket, performing the update inplace and then unlocking it.…”

Section: Trie: Height Optimized Trie (Hot)mentioning

confidence: 99%

“…While research on building concurrent, crash-consistent PM indexes has been gathering traction recently, there have been decades of research on building concurrent DRAM Se Kwon Lee and Jayashree Mohan are supported by SOSP 2019 student travel scholarships from the National Science Foundation and ACM Special Interest Group in Operating Systems respectively. indexes [16,17,22,27,28,54,66,67,70]; for example, the skip list [62] was invented thirty years ago. Modern in-memory data structures are carefully designed keeping in mind cache efficiency [63], pre-fetching [8], concurrency, and parallelism via SIMD instructions [10,75].…”

Section: Introductionmentioning

confidence: 99%

“…We present our experience with converting five DRAM indexes using Recipe, each based on a different data structure: Adaptive Radix Tree (ART) [47,48], Height Optimized Trie (HOT) [4], BwTree [49], Cache-Line Hash Table (CLHT) [16] and Masstree [53]. Table 1 categorizes these DRAM indexes based on the condition they satisfy, and the effort involved in converting them to be persistent (as a percentage of change to the core codebase that excludes tests and helper libraries).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Recipe

Lee

Mohan

Kashyap

et al. 2019

Proceedings of the 27th ACM Symposium on Operating Systems Principles

119

View full text Add to dashboard Cite

We present Recipe, a principled approach for converting concurrent DRAM indexes into crash-consistent indexes for persistent memory (PM). The main insight behind Recipe is that isolation provided by a certain class of concurrent in-memory indexes can be translated with small changes to crash-consistency when the same index is used in PM. We present a set of conditions that enable the identification of this class of DRAM indexes, and the actions to be taken to convert each index to be persistent. Based on these conditions and conversion actions, we modify five different DRAM indexes based on B+ trees, tries, radix trees, and hash tables to their crash-consistent PM counterparts. The effort involved in this conversion is minimal, requiring 30-200 lines of code. We evaluated the converted PM indexes on Intel DC Persistent Memory, and found that they outperform state-of-the-art, hand-crafted PM indexes in multi-threaded workloads by up-to 5.2×. For example, we built P-CLHT, our PM implementation of the CLHT hash table by modifying only 30 LOC. When running YCSB workloads, P-CLHT performs up to 2.4× better than Cacheline-Conscious Extendible Hashing (CCEH), the state-of-the-art PM hash table.

show abstract

RCU‐HTM: A generic synchronization technique for highly efficient concurrent search trees

Siakavaras

Nikas

Goumas

et al. 2021

Concurrency and Computation

View full text Add to dashboard Cite

Concurrent search trees (STs) are among the most widely used data structures to store and retrieve data in contemporary multithreaded applications. Despite the high amount of prior work, it still remains challenging to implement highly efficient concurrent STs. This is mainly due to the fact that both traditional synchronization methods (i.e., locks and atomic operations) and more novel ones (i.e., read‐copy‐update and transactional memory) fail to provide solutions that are generic and at the same time able to attain high performance under diverse workloads and contention levels. In this work, we present RCU‐HTM, a technique that combines read‐copy‐update (RCU) and hardware transactional memory (HTM), and: (a) supports the implementation of a concurrent version of any type of search tree, and (b) achieves high performance across all execution scenarios. We also incorporate a low‐overhead, epoch‐based memory reclamation scheme to make our RCU‐HTM trees practical for large‐scale long‐running applications. To showcase the capabilities of our technique, we implement and evaluate multiple RCU‐HTM trees and compare their performance with several state‐of‐the‐art competitors. More specifically, we apply RCU‐HTM to 12 different types of binary, B+ and (a,b)‐trees and compare against 18 state‐of‐the‐art implementations that use four different synchronization mechanisms, namely, locks, atomic operations, RCU, and HTM. We evaluate the trees under different levels of contention by varying the size of the tree, the operations mix, and the number of threads, for a total of 210 execution scenarios for each implementation. Our evaluation shows that in the majority of executions, RCU‐HTM trees outperform their state‐of‐the‐art alternatives, and even in the cases where they do not, their performance is very close to that of the best implementation.

show abstract

Asynchronized Concurrency

Cited by 83 publications

References 37 publications

Efficient lock-free durable sets

Efficient lock-free durable sets

Recipe

RCU‐HTM: A generic synchronization technique for highly efficient concurrent search trees

Contact Info

Product

Resources

About