LoLKV: The Logless, Linearizable, RDMA-based Key-Value Storage System
Talkat 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) · 2024-04-16..04-18·
summary
LoLKV implements a logless, linearizable RDMA key-value store that uses one critical-path RDMA write to replicate a packed segment entry and an asynchronous RDMA write to lazily update follower hash tables, plus per-thread sequence numbers and incarnation counters to order concurrent writes to the same key. Followers are passive to avoid duplicate apply work, leader election includes state synchronization, and evaluation shows 1.7–10× higher throughput and 20–92% lower 99th‑percentile latency versus prior RDMA KV systems.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 0:43Log-based consensus limits
- 2:52How LoLKV addresses these limitations
- 3:56System design overview
- 5:41Handling put requests
- 8:08Concurrent writes
- 10:35Leader election & sync
- 11:19Evaluation & results
- 13:28Conclusion
related talks
15mReplicating Persistent Memory Key-Value Stores with Efficient RDMA Abstraction
15mXLL: Cross-Layer Logging for Data Deduplication in Consensus-Based Storage
13mDifferentiated Key-Value Storage Management for Balanced I/O Performance
15mKVIMR: Key-Value Store Aware Data Management Middleware for Interlaced Magnetic...
18mSplitKV: Splitting IO Paths for Different Sized Key-Value Items with Advanced
19mBuilding KVStore for ML Workloads
21mMatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores
01h 02mRonDB: A Key-Value Store with SQL Capabilities and LATS Properties