AsymNVM: An Efficient Framework for Implementing Persistent Data Structures on Asymmetric NVM Architecture

被引:32
|
作者
Ma, Teng [1 ]
Zhang, Mingxing [2 ,3 ]
Chen, Kang [1 ]
Song, Zhuo [4 ]
Wu, Yongwei [1 ]
Qian, Xuehai [5 ]
机构
[1] Tsinghua Univ, Beijing, Peoples R China
[2] Tsinghua Univ, Shenzhen, Peoples R China
[3] Sangfor, Shenzhen, Peoples R China
[4] Alibaba, Beijing, Peoples R China
[5] Univ Southern Calif, Los Angeles, CA USA
来源
TWENTY-FIFTH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS (ASPLOS XXV) | 2020年
基金
中国博士后科学基金; 美国国家科学基金会; 中国国家自然科学基金;
关键词
memory architectures; persistent memory; RDMA; PHASE-CHANGE MEMORY; STORAGE;
D O I
10.1145/3373376.3378511
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The byte-addressable non-volatile memory (NVM) is a promising technology since it simultaneously provides DRAM-like performance, disk-like capacity, and persistency. The current NVM deployment with byte-addressability is symmetric, where NVM devices are directly attached to servers. Due to the higher density, NVM provides much larger capacity and should be shared among servers. Unfortunately, in the symmetric setting, the availability of NVM devices is affected by the specific machine it is attached to. High availability can be achieved by replicating data to NVM on a remote machine. However, it requires full replication of data structure in local memory - limiting the size of the working set. This paper rethinks NVM deployment and makes a case for the asymmetric byte-addressable non-volatile memory architecture, which decouples servers from persistent data storage. In the proposed AsymNVM architecture, NVM devices (i.e., back-end nodes) can be shared by multiple servers (i.e., front-end nodes) and provide recoverable persistent data structures. The asymmetric architecture, which follows the industry trend of resource disaggregation, is made possible due to the high-performance network (e.g., RDMA). At the same time, AsymNVM leads to a number of key problems such as, still relatively long network latency, persistency bot-tleneck, and simple interface of the back-end NVM nodes. We build AsymNVM framework based on AsymNVM architecture that implements: 1) high performance persistent data structure update; 2) NVM data management; 3) concurrency control; and 4) crash-consistency and replication. The key idea to remove persistency bottleneck is the use of operation log that reduces stall time due to RDMA writes and enables efficient batching and caching in front-end nodes. To evaluate performance, we construct eight widely used data structures and two transaction applications based on AsymNVM framework. In a 10-node cluster equipped with real NVM devices, results show that AsymNVM achieves similar or better performance compared to the best possible symmetric architecture while enjoying the benefits of disaggregation. We found the speedup brought by the proposed optimizations is drastic, - 5 similar to 12x among all benchmarks.
引用
收藏
页码:757 / 773
页数:17
相关论文
共 20 条
  • [1] Implementing persistent data structures using C++
    Parrish, A
    Dixon, B
    Cordes, D
    Vrbsky, S
    Lusth, J
    SOFTWARE-PRACTICE & EXPERIENCE, 1998, 28 (15): : 1559 - 1579
  • [2] Efficient Dynamic Data Visualization with Persistent Data Structures
    Cottam, Joseph A.
    Lumsdaine, Andrew
    VISUALIZATION AND DATA ANALYSIS 2012, 2012, 8294
  • [3] Implementing I/O-efficient data structures using TPIE
    Arge, L
    Procopiuc, O
    Vitter, JS
    ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 88 - 100
  • [4] Implementing efficient data compression and encryption in a persistent key-value store for HPC
    Kim, Jungwon
    Vetter, Jeffrey S.
    INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2019, 33 (06): : 1098 - 1112
  • [5] Hashed and hierarchical timing wheels: Efficient data structures for implementing a timer facility
    Varghese, G
    Lauck, A
    IEEE-ACM TRANSACTIONS ON NETWORKING, 1997, 5 (06) : 824 - 834
  • [6] Versioned Programming: A Simple Technique for Implementing Efficient, Lock-Free, and Composable Data Structures
    Zhan, Yang
    Porter, Donald E.
    PROCEEDINGS OF THE 9TH ACM INTERNATIONAL SYSTEMS AND STORAGE CONFERENCE (SYSTOR'16), 2016,
  • [7] An efficient data-driven optimization framework for designing graded cellular structures
    Liu, Hui
    Qi, Yitong
    Chen, Lianxiong
    Li, Yingwei
    Xiao, Wenlei
    APPLIED MATHEMATICAL MODELLING, 2024, 125 : 574 - 598
  • [8] Brief Announcement: Persistent Atomics for Implementing Durable Lock-Free Data Structures for Non-Volatile Memory
    Wang, William
    Diestelhorst, Stephan
    SPAA'19: PROCEEDINGS OF THE 31ST ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURESS, 2019, 2019, : 309 - 311
  • [9] Performance assessment and comparison of symmetric and asymmetric augmented data vortex architecture for HPC using efficient algorithm
    Amrita Soni
    Neha Sharma
    Soft Computing, 2023, 27 : 4235 - 4247
  • [10] Performance assessment and comparison of symmetric and asymmetric augmented data vortex architecture for HPC using efficient algorithm
    Soni, Amrita
    Sharma, Neha
    SOFT COMPUTING, 2023, 27 (07) : 4235 - 4247