Cuckoo for Clients: Disaggregated Cuckoo Hashing
summary
RCuckoo is a fully disaggregated, lock‑based key/value store that uses one‑sided RDMA to get single round‑trip reads for small values and two round trips for updates and deletes. It implements locality‑enhanced dependent hashing so most inserts stay within 32–256 rows, enabling practical fill factors up to ~90% and low lock contention. Evaluation shows up to 7× throughput under severe contention versus prior RDMA systems, and a lease‑based locking recovery that tolerates hundreds of client failures per second.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 3:50Disaggregated memory challenges
- 5:15One-sided RDMA data structures
- 7:45Traditional cuckoo limits
- 9:14Locality hashing introduction
- 11:22Locality benefits in insertions
- 13:49Locking strategy and performance
- 14:53Evaluation on read-write workloads
- 15:35Fault tolerance for client failures
- 16:58Summary
related talks
20mMitigating Asymmetric Read and Write Costs in Cuckoo Hashing for Storage Systems
20mAdaptive Online Cache Capacity Optimization via Lightweight Working Set Size...
15mOne-sided RDMA-Conscious Extendible Hashing for Disaggregated Memory
25mMemC3: Compact and Concurrent MemCache with Dumber Caching and Smarter Hashing
01h 13mC++ Memory Model Meets High-Update-Rate Data Structures
24mHotRing: A Hotspot-Aware In-Memory Key-Value Store
01h 11mFearless global transactions with
48mBuilding mission-critical applications with CockroachDB