Persisting RB-Tree into NVM in a Consistency Perspective

Wang, Chundong; Wei, Qingsong; Wu, Lingkun; Wang, Sibo; Chen, Cheng; Xiao, Xiaokui; Yang, Jun; Xue, Minhui; Yang, Yechao

doi:10.1145/3177915

Cited by 16 publications

(11 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As expected, the insert costs are independent of the size of the tree. It also shows For the evaluation of their RBT code Wang et al [63] simulated NVDIMM, STT-RAM, and PCM. For insert with 10 6 resp.…”

Section: Discussionmentioning

confidence: 99%

“…As long as updates are atomic, i.e., 8 bytes for NVRAM or a block for SSDs, they can be done in-place. For non-atomic updates, transaction systems [39,63,6] use a combination of different techniques to preserve consistency in the face of crashes. Logging uses undo and redo logs to store enough data to roll-back an interrupted transaction (undo) or retry the transaction again (redo).…”

Section: Logging and Shadow Copyingmentioning

confidence: 99%

“…Red-Black Trees in NVRAM were discussed in Wang et al [63] for the first time. While they implemented a more complex tree kind than before, they still relied on shadow copying and a versioning system to distinguish between the copy and the real tree.…”

Section: Related Workmentioning

confidence: 99%

“…For B+ trees, a constant amount of memory is needed, i.e., the size of a node, which simplifies the process. As Wang et al [63] noted, for Red-Black Trees copy-on-write operations touch almost the complete tree. One needs to allocate and de-allocate a variable amount of memory for operations.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Transactions on Red-black and AVL trees in NVRAM

Schütt¹,

Schintke²,

Skrzypczak³

2020

Preprint

View full text Add to dashboard Cite

Byte-addressable non-volatile memory (NVRAM) supports persistent storage with low latency and high bandwidth. Complex data structures in it ought to be updated transactionally, so that they remain recoverable at all times. Traditional database technologies such as keeping a separate log, a journal, or shadow data work on a coarse-grained level, where the whole transaction is made visible using a final atomic update operation. These methods typically need significant additional space overhead and induce non-trivial overhead for log pruning, state maintenance, and resource (de-)allocation. Thus, they are not necessarily the best choice for NVRAM, which supports fine-grained, byte-addressable access.We present a generic transaction mechanism to update dynamic complex data structures 'in-place' with a constant memory overhead. It is independent of the size of the data structure. We demonstrate and evaluate our approach on Red-Black Trees and AVL Trees with a redo log of constant size (4 resp. 2 cache lines). The redo log guarantees that each accepted (started) transaction is executed eventually despite arbitrary many system crashes and recoveries in the meantime. We update complex data structures in local and remote NVRAM providing exactly once semantics and durable linearizability for multi-reader single-writer access. To persist data, we use the available processor instructions for NVRAM in the local case and remote direct memory access (RDMA) combined with a software agent in the remote case.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Logging and Shadow Copyingmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Transactions on Red-black and AVL trees in NVRAM

Schütt¹,

Schintke²,

Skrzypczak³

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…The past decade has seen extensive work on persistent data structures, much of it focused on Btree indices for file systems and databases [3,6,7,27,30,32,45,51,55]. Other work has targeted queues [18], RB trees [53], radix trees [31], and hash tables [8,44,48,56].…”

Section: Related Workmentioning

confidence: 99%

Fast Nonblocking Persistence for Concurrent Data Structures

Cai,

Wen,

Maksimovski

et al. 2021

Preprint

View full text Add to dashboard Cite

We present a fully lock-free variant of the recent Montage system for persistent data structures. Our variant, nbMontage, adds persistence to almost any nonblocking concurrent structure without introducing significant overhead or blocking of any kind. Like its predecessor, nbMontage is buffered durably linearizable: it guarantees that the state recovered in the wake of a crash will represent a consistent prefix of pre-crash execution. Unlike its predecessor, nbMontage ensures wait-free progress of the persistence frontier, thereby bounding the number of recent updates that may be lost on a crash, and allowing a thread to force an update of the frontier (i.e., to perform a sync operation) without the risk of blocking. As an extra benefit, the helping mechanism employed by our wait-free sync significantly reduces its latency.Performance results for nonblocking queues, skip lists, trees, and hash tables rival custom data structures in the literature-dramatically faster than achieved with prior general-purpose systems, and generally within 50% of equivalent non-persistent structures placed in DRAM.

show abstract

DONUTS: An efficient method for checkpointing in non‐volatile memories

Kruger

Pannain

Azevedo

2023

Concurrency and Computation

View full text Add to dashboard Cite

Non-volatile memory (NVM) is an emerging technology being explored as an alternative to DRAM main memory in computing systems because of its persistence, higher storage density, lower energy consumption, and access latency close to DRAM. However, persistent memory systems must ensure data consistency on system failures, a property known as crash consistency. One of the main challenges in these systems is creating efficient checkpointing mechanisms in terms of performance and usability. Thus, it is necessary to remove persistence from the critical execution path and reduce the excessive number of writes to NVM caused by logging operations, resulting in increased memory bandwidth usage. Another limitation is that most proposed mechanisms restrict application source code to programming interfaces based on transactional models, typed as software-based approaches. These factors make it challenging to adopt NVM systems. This article presents a software-transparent mechanism based on dynamic epochs with logging operations via processing-in-memory and checkpoints integrated into the cache replacement policy. Compared to the previous best-performing system, our strategy reduces 50.6% of writes to NVM. Furthermore, it does not increase the average memory bandwidth usage, providing crash consistency with less than 2% runtime overhead.

show abstract

Persisting RB-Tree into NVM in a Consistency Perspective

Cited by 16 publications

References 29 publications

Transactions on Red-black and AVL trees in NVRAM

Transactions on Red-black and AVL trees in NVRAM

Fast Nonblocking Persistence for Concurrent Data Structures

DONUTS: An efficient method for checkpointing in non‐volatile memories

Contact Info

Product

Resources

About