Failure-Atomic Slotted Paging for Persistent Memory

Seo, Jihye; Kim, Wook-Hee; Baek, Woongki; Nam, Beomseok; Noh, Sam H.

doi:10.1145/3037697.3037737

Cited by 32 publications

(23 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Byte-addressable compaction just points to the corresponding area on sequential nodes by the new skip list until the size threshold of the skip list, then finally adds the null node for the recovery. Persistent memory devices are expected to guarantee failure-atomic writes in 8-byte units [25], [28], [29], [30]. Because the size of pointer variables is 4 bytes in 32-bit system and 8 bytes in 64-bit system, failure-atomic operation on compaction is valid.…”

Section: B Byte-addressable Compactionmentioning

confidence: 99%

TLSM: Tiered Log-Structured Merge-Tree Utilizing Non-Volatile Memory

et al. 2020

View full text Add to dashboard Cite

Log-Structured Merge-tree (LSM-tree) organizes write-friendly and hierarchical structure, which leads to inevitable disk I/O from data compaction occuring between layers. Previous research tried to reduce write bottlenecks of LSM-tree by using non-volatile memory (NVM) to LSM-tree, but write amplification on compaction does not resolved. In this paper, we present tiered LSM (TLSM), a persistent LSM-based key-value database tiering NVM, which is regarded as fast storage device. Our design aims to exploit multi-layered LSM system utilizing NVM and reduce redundant cost on compaction. We address 4 key points: (1) analysis of disk I/O overhead on current LSM-tree, (2) novel design of TLSM preserving the concept of LSM-tree and utilizing NVM, (3) persistent and byte-addressable data compaction minimizing disk write, and (4) tiering policy for increasing usability to TLSM. To implement TLSM-tree, we extended LevelDB, which is a simple LSM-based key-value store. On micro-benchmark DB Bench, the write and read latencies of TLSM are improved up to 34% and 57%, respectively, compared to those of LevelDB-NVM. In evaluation of YCSB, TLSM also reduces the write and read latencies of existing LevelDB up to 25%, 33%, respectively. Furthermore, frequency of write stall and total amount of data write are reduced significantly in TLSM.

show abstract

Section: B Byte-addressable Compactionmentioning

confidence: 99%

TLSM: Tiered Log-Structured Merge-Tree Utilizing Non-Volatile Memory

et al. 2020

View full text Add to dashboard Cite

show abstract

“…With this page abstraction, the buffer cache manager in database systems communicates with I/O devices. To arrange a collection of records in a page, the slotted-page structure [6,17,18] is commonly used in various database systems ranging from mobile DBMSs such as SQLite to server-client DBMSs such as PostgreSQL, InnoDB, and Oracle [6]. The slotted-page structure has a slot-header (also referred to as a directory of slots) at the beginning of the page, free space in the middle, and a record content area at the end of the page.…”

Section: Background and Related Workmentioning

confidence: 99%

“…To avoid the journaling of journal problem, various approaches have been proposed to improve the performance of mobile storage systems. For example, new byte-addressable nonvolatile memory (NVM) media has been employed [4][5][6], the file system has been modified to mitigate the overhead of fsync() calls [7][8][9][10][11][12], and SQLite has been modified to employ other logging methods, such as multi-version B-tree (MVBT) [13], WALDIO (WAL+direct IO) [8], and DASH (DB file shadowing) [14], to reduce the I/O traffic.…”

Section: Introductionmentioning

confidence: 99%

Doubleheader Logging: Eliminating Journal Write Overhead for Mobile DBMS

Kim

Seo

et al. 2020

2020 IEEE 36th International Conference on Data Engineering (ICDE)

Self Cite

View full text Add to dashboard Cite

“…Our approach is similar, but it leverages DAX to avoid the file system and leverage NVMM. SQLite/PPL [49], NVWAL [35] use slotted paging [55] to make SQLite run efficiently on NVMM. A comparison to these systems would be interesting, but unfortunately, none of them is publicly available.…”

Section: Sqlitementioning

confidence: 99%

Finding and Fixing Performance Pathologies in Persistent Memory Software Stacks

Kim

Memaripour

et al. 2019

Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Syst

View full text Add to dashboard Cite

Emerging fast, non-volatile memories will enable systems with large amounts of non-volatile main memory (NVMM) attached to the CPU memory bus, bringing the possibility of dramatic performance gains for IO-intensive applications. This paper analyzes the impact of state-of-the-art NVMM storage systems on some of these applications and explores how those applications can best leverage the performance that NVMMs offer. Our analysis leads to several conclusions about how systems and applications should adapt to NVMMs. We propose FiLe Emulation with DAX (FLEX), a technique for moving file operations into user space, and show it and other simple changes can dramatically improve application performance. We examine the scalability of NVMM file systems in light of the rising core counts and pronounced NUMA effects in modern systems, and propose changes to Linux's virtual file system (VFS) to improve scalability. We also show that adding NUMA-aware interfaces to an NVMM file system can significantly improve performance.

show abstract

Failure-Atomic Slotted Paging for Persistent Memory

Cited by 32 publications

References 34 publications

TLSM: Tiered Log-Structured Merge-Tree Utilizing Non-Volatile Memory

TLSM: Tiered Log-Structured Merge-Tree Utilizing Non-Volatile Memory

Doubleheader Logging: Eliminating Journal Write Overhead for Mobile DBMS

Finding and Fixing Performance Pathologies in Persistent Memory Software Stacks

Contact Info

Product

Resources

About