CIDER: Boosting Memory-Disaggregated Key-Value Stores with Pessimistic Synchronization
This addresses performance issues for systems using memory-disaggregated key-value stores, representing an incremental improvement with a novel method for a known bottleneck.
The paper tackled the performance bottleneck in memory-disaggregated key-value stores caused by redundant I/Os from optimistic synchronization, and proposed CIDER with pessimistic synchronization, achieving up to 6.6x throughput improvement under the YCSB benchmark.
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\times$ under the YCSB benchmark.