XStore : Fast RDMA-Based Ordered Key-Value Store Using Remote Learned Cache

Author:

Wei Xingda1,Chen Rong1,Chen Haibo2,Zang Binyu2

Affiliation:

1. Shanghai Jiao Tong University, China and Shanghai Artificial Intelligence Laboratory, Shanghai, China

2. Shanghai Jiao Tong University, China and Domain-Specific Operating Systems, Ministry of Education, Shanghai, China

Abstract

RDMA ( Remote Direct Memory Access ) has gained considerable interests in network-attached in-memory key-value stores. However, traversing the remote tree-based index in ordered key-value stores with RDMA becomes a critical obstacle, causing an order-of-magnitude slowdown and limited scalability due to multiple round trips. Using index cache with conventional wisdom—caching partial data and traversing them locally—usually leads to limited effect because of unavoidable capacity misses, massive random accesses, and costly cache invalidations. We argue that the machine learning (ML) model is a perfect cache structure for the tree-based index, termed learned cache . Based on it, we design and implement XStore , an RDMA-based ordered key-value store with a new hybrid architecture that retains a tree-based index at the server to perform dynamic workloads (e.g., inserts) and leverages a learned cache at the client to perform static workloads (e.g., gets and scans). The key idea is to decouple ML model retraining from index updating by maintaining a layer of indirection from logical to actual positions of key-value pairs. It allows a stale learned cache to continue predicting a correct position for a lookup key. XStore ensures correctness using a validation mechanism with a fallback path and further uses speculative execution to minimize the cost of cache misses. Evaluations with YCSB benchmarks and production workloads show that a single XStore server can achieve over 80 million read-only requests per second. This number outperforms state-of-the-art RDMA-based ordered key-value stores (namely, DrTM-Tree, Cell, and eRPC+Masstree) by up to 5.9× (from 3.7×). For workloads with inserts, XStore still provides up to 3.5× (from 2.7×) throughput speedup, achieving 53M reqs/s. The learned cache can also reduce client-side memory usage and further provides an efficient memory-performance tradeoff, e.g., saving 99% memory at the cost of 20% peak throughput.

Funder

National Key Research and Development Program of China

National Natural Science Foundation of China

Huawei Technologies

Publisher

Association for Computing Machinery (ACM)

Subject

Hardware and Architecture

Reference63 articles.

1. 2021. Intel’s Math Kernel Library. (2021). https://software.intel.com/content/www/us/en/develop/tools/math-kernel-library.html. 2021. Intel’s Math Kernel Library. (2021). https://software.intel.com/content/www/us/en/develop/tools/math-kernel-library.html.

2. Designing Far Memory Data Structures

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Enabling Efficient Erasure Coding in Disaggregated Memory Systems;IEEE Transactions on Parallel and Distributed Systems;2024-01

2. FastStore: A High-Performance RDMA-Enabled Distributed Key-Value Store with Persistent Memory;2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS);2023-07

3. Design Guidelines for Correct, Efficient, and Scalable Synchronization using One-Sided RDMA;Proceedings of the ACM on Management of Data;2023-06-13

4. DevIOus: Device-Driven Side-Channel Attacks on the IOMMU;2023 IEEE Symposium on Security and Privacy (SP);2023-05

5. DEVIOUS: Device-Driven Side-Channel Attacks on the IOMMU;P IEEE S SECUR PRIV;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3