English

CIDER: Boosting Memory-Disaggregated Key-Value Stores with Pessimistic Synchronization

Distributed, Parallel, and Cluster Computing 2026-04-06 v1 Databases

Abstract

Memory-disaggregated key-value (KV) stores suffer from a severe performance bottleneck due to their I/O redundancy issues. A huge amount of redundant I/Os are generated when synchronizing concurrent data accesses, making the limited network between the compute and memory pools of DM a performance bottleneck. We identify the root cause for the redundant I/O lies in the mismatch between the optimistic synchronization of existing memory-disaggregated KV stores and the highly concurrent workloads on DM. In this paper, we propose to boost memory-disaggregated KV stores with pessimistic synchronization. We propose CIDER, a compute-side I/O optimization framework, to verify our idea. CIDER adopts a global write-combining technique to further reduce cross-node redundant I/Os. A contention-aware synchronization scheme is designed to improve the performance of pessimistic synchronization under low contention scenarios. Experimental results show that CIDER effectively improves the throughput of state-of-the-art memory-disaggregated KV stores by up to 6.6×6.6\times under the YCSB benchmark.

Keywords

Cite

@article{arxiv.2604.03007,
  title  = {CIDER: Boosting Memory-Disaggregated Key-Value Stores with Pessimistic Synchronization},
  author = {Yuxuan Du and Xuchuan Luo and Xin Wang and Yangfan Zhou and Jiacheng Shen},
  journal= {arXiv preprint arXiv:2604.03007},
  year   = {2026}
}

Comments

This paper is accepted by VLDB'26

R2 v1 2026-07-01T11:52:47.993Z