A High-performance RDMA-oriented Learned Key-value Store for Disaggregated Memory Systems

被引:0
作者
Li, Pengfei [1 ]
Hua, Yu [1 ]
Zuo, Pengfei [1 ]
Chen, Zhangyu [1 ]
Sheng, Jiajie [1 ]
机构
[1] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Sch Comp Sci & Technol, Luoyu Rd 1037, Wuhan 430074, Peoples R China
基金
中国国家自然科学基金;
关键词
Disaggregated memory system; learned index; key-value store; INDEX; END;
D O I
10.1145/3620674
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Disaggregated memory systems separate monolithic servers into different components, including compute and memory nodes, to enjoy the benefits of high resource utilization, flexible hardware scalability, and efficient data sharing. By exploiting the high-performance RDMA (Remote Direct Memory Access), the compute nodes directly access the remote memory pool without involving remote CPUs. Hence, the ordered keyvalue (KV) stores (e.g., B-trees and learned indexes) keep all data sorted to provide range query services via the high-performance network. However, existing ordered KVs fail to work well on the disaggregated memory systems, due to either consuming multiple network roundtrips to search the remote data or heavily relying on the memory nodes equipped with insufficient computing resources to process data modifications. In this article, we propose a scalable RDMA-oriented KV store with learned indexes, called ROLEX, to coalesce the ordered KV store in the disaggregated systems for efficient data storage and retrieval. ROLEX leverages a retraining-decoupled learned index scheme to dissociate the model retraining from data modification operations via adding a bias and some data movement constraints to learned models. Based on the operation decoupling, data modifications are directly executed in compute nodes via one-sided RDMA verbs with high scalability. The model retraining is hence removed from the critical path of data modification and asynchronously executed in memory nodes by using dedicated computing resources. ROLEX efficiently alleviates the fragmentation and garbage collection issues, due to allocating and reclaiming space via fixed-size leaves that are accessed via the atomic-size leaf numbers. Our experimental results on YCSB and real-world workloads demonstrate that ROLEX achieves competitive performance on the static workloads, as well as significantly improving the performance on dynamic workloads by up to 2.2x over state-of-the-art schemes on the disaggregated memory systems. We have released the open-source codes for public use in GitHub.
引用
收藏
页数:30
相关论文
共 50 条
  • [1] ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems
    Li, Pengfei
    Hua, Yu
    Zuo, Pengfei
    Chen, Zhangyu
    Sheng, Jiajie
    PROCEEDINGS OF THE 21ST USENIX CONFERENCE ON FILE AND STORAGE TECHNOLOGIES, FAST 2023, 2023, : 99 - 113
  • [2] TrickleKV: A High-Performance Key-Value Store on Disaggregated Storage With Low Network Traffic
    Zhan, Ling
    Lu, Kai
    Xiong, Yiqin
    Wan, Jiguang
    Yang, Zixuan
    IEEE ACCESS, 2024, 12 : 167596 - 167612
  • [3] AStore: Uniformed Adaptive Learned Index and Cache for RDMA-Enabled Key-Value Store
    Qiao, Pengpeng
    Zhang, Zhiwei
    Li, Yuntong
    Yuan, Ye
    Wang, Shuliang
    Wang, Guoren
    Yu, Jeffrey Xu
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (07) : 2877 - 2894
  • [4] NStore: A High-Performance NUMA-Aware Key-Value Store for Hybrid Memory
    Wang, Zhonghua
    Lu, Kai
    Wan, Jiguang
    Jiang, Hong
    Zhao, Zeyang
    Xu, Peng
    Lai, Biliang
    Li, Guokuan
    Xie, Changsheng
    IEEE TRANSACTIONS ON COMPUTERS, 2025, 74 (03) : 929 - 943
  • [5] FlashKey:A High-Performance Flash Friendly Key-Value Store
    Ray, Madhurima
    Kant, Krishna
    Li, Peng
    Trika, Sanjeev
    2020 IEEE 34TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM IPDPS 2020, 2020, : 976 - 985
  • [6] HyperKV: A High Performance Concurrent Key-Value Store for Persistent Memory
    Sun, Penghao
    Xue, Dongliang
    You, Litong
    Yan, Yan
    Huang, Linpeng
    19TH IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING WITH APPLICATIONS (ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM 2021), 2021, : 125 - 134
  • [7] KV-Direct: High-Performance In-Memory Key-Value Store with Programmable NIC
    Li, Bojie
    Ruan, Zhenyuan
    Xiao, Wencong
    Lu, Yuanwei
    Xiong, Yongqiang
    Putnam, Andrew
    Chen, Enhong
    Zhang, Lintao
    PROCEEDINGS OF THE TWENTY-SIXTH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (SOSP '17), 2017, : 137 - 152
  • [8] A Fast Learned Key-Value Store for Concurrent and Distributed Systems
    Li, Pengfei
    Hua, Yu
    Jia, Jingnan
    Zuo, Pengfei
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (06) : 2301 - 2315
  • [9] TeksDB:Weaving Data Structures for a High-Performance Key-Value Store
    Han Y.
    Kim B.S.
    Yeon J.
    Lee S.
    Lee E.
    Performance Evaluation Review, 2019, 47 (01): : 69 - 70
  • [10] MaiterStore: A Hot-Aware, High-Performance Key-Value Store for Graph Processing
    Chang, Dong
    Zhang, Yanfeng
    Yu, Ge
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, DASFAA 2014, 2014, 8505 : 117 - 131