arrow
Return

WOPE: A write-optimized and parallel-efficient B plus -tree for persistent memory ☆

delete2024-08-01
delete0
PRE
AI
X
Xianyu He
R
Runyu Zhang *
P
Pengpeng Tian
L
Lening Zhou
M
Min Lian
杨
杨朝树 (Chaoshu Yang)
DOI:10.1016/j.sysarc.2024.103187delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Emerging Persistent Memory (PM) usually has the serious drawback of expensive write activities. Thus, existing PM -oriented B + -trees mainly concentrate on alleviating the write overhead (i.e., reducing PM writes and flush instructions). Unfortunately, due to the improper data organization in the sorted leaf node, existing solutions cause massive data migration when data inserting or node splitting occurs. In this paper, we propose a writeoptimized PM -oriented B + -tree with aligned flush and selective migration, called WPB + -tree, to solve the above problems. WPB + -tree first adopts a buffer -assisted mechanism that temporarily stores the newly inserted data to reduce the overhead of entry shifts. Second, WPB + -tree employs a selective migration of node entries scheme to achieve less than half of the data migration when a node is split. Moreover, existing PM -oriented B + -trees usually employ a coarse -grained lock to avoid thread conflicts, which can severely degrade the concurrency efficiency. Thus, we further propose a fine-grained lock technique for WPB + -tree, namely, parallel -efficient WPB + -tree (WOPE), to improve the concurrency efficiency. We implement the proposed WPB + -tree and WOPE on Linux and conduct extensive evaluations with actual persistent memory, where WOPE achieves 23.5%, 30.7%, and 15.3% of performance improvement ( insert , read , and scan ) over the straightforward solutions (i.e., SSB-Tree, Fast&Fair, and wB + tree), and 10.1% of performance improvement over WPB + -tree, on average.
Keywords:
Persistent memory
B plus -tree
Write optimization
Concurrency control

Journal

Journal of Systems Architecture cover
Journal of Systems Architecture
IF:
4.1
Papers:
3.0K
Citations:
4.2K

Organization

G
guizhou university
Scholars:
2.5W
Papers: 1.3W
Citations: 15
Cited Papers

Cited Papers

Resistive Random Access Memory (ReRAM) Based on Metal Oxides
err2010-12-01
err903
PREAI
errAkinaga, Hiroyuki; Shima, Hisashi
errShare
errSave
Linked Block-based Multiversion B-Tree index for PCM-based embedded databases
err2015-10-01
err4
PREAI
errZhu, Chun Jiang; Lam, Kam-Yiu; Chang, Yuan-Hao; Ng, Joseph Kee Yin
errShare
errSave
Facile preparation of in situ coated Ti3C2Tx/Ni0.5Zn0.5Fe2O4composites and their electromagnetic performance
err2017-01-01
err0
errOAAI
errYoubing Li; Xiaobing Zhou; Jing Wang; Qihuang Deng; Mian Li; Shiyu Du; Young-Hwan Han; Jaehyung Lee; Qing Huang
errShare
errSave
The recurrence risk of neural tube defects (NTDs) in a population with high prevalence of NTDs in northern China
err2017-08-03
err0
errOAAI
errJufen Liu; Zhiwen Li; Nicholas D.E. Greene; Hongtian Li; Aiguo Ren
errShare
errSave
A write-optimal and concurrent persistent dynamic hashing with radix tree assistance
err2022-04-01
err7
PREAI
errZou, Xiaomin; Wang, Fang; Feng, Dan; Zhu, Junhao; Xiao, Renzhi; Su, Nan
errShare
errSave
Land‐use history determines stand structure and tree diversity in vanilla agroforests of northeastern Madagascar
err2021-02-17
err0
errOAAI
errKristina Osen; Marie Rolande Soazafy; Dominic Andreas Martin; Annemarie Wurz; Adriane März; Hery Lisy Tiana Ranarijaona; Dirk Hölscher
errShare
errSave
errShare
errSave
Towards the Design of Efficient and Consistent Index Structure with Minimal Write Activities for Non-Volatile Memory
err2018-03-01
err6
PREAI
errSha, Edwin Hsing-Mean; Jiang, Weiwen; Dong, Hailiang; Ma, Zhulin; Zhang, Runyu; Chen, Xianzhang; Zhuge, Qingfeng
errShare
errSave
researcher View more