Name
Abstract | ||
|---|---|---|
Memory disaggregation architecture physically separates CPU and memory into independent components, which are connected via high-speed RDMA networks, greatly improving resource utilization of databases. However, such an architecture poses unique challenges to data indexing due to limited RDMA semantics and near-zero computation power at memory-side. Existing indexes supporting disaggregated memory either suffer from low write performance, or require hardware modification. This paper presents SHERMAN, a write-optimized distributed B(+)Tree index on disaggregated memory that delivers high performance with commodity RDMA NICs. SHERMAN combines RDMA hardware features and RDMA-friendly software techniques to boost index write performance from three angles. First, to reduce round trips, SHERMAN coalesces dependent RDMA commands by leveraging in-order delivery property of RDMA. Second, to accelerate concurrent accesses, SHERMAN introduces a hierarchical lock that exploits on-chip memory of RDMA NICs. Finally, to mitigate write amplification, SHERMAN tailors the data structure layout of B(+)Tree with a two-level version mechanism. Our evaluation shows that, SHERMAN is one order of magnitude faster in terms of both throughput and 99th percentile latency on typical write-intensive workloads, compared with state-of-the-art designs. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1145/3514221.3517824 | PROCEEDINGS OF THE 2022 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA (SIGMOD '22) |
Keywords | DocType | ISSN |
disaggregated memory, index, RDMA | Conference | 0730-8078 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||