论文标题
通过有效的RDMA抽象复制持续的内存键值存储
Replicating Persistent Memory Key-Value Stores with Efficient RDMA Abstraction
论文作者
论文摘要
将持久存储器（PM）与RDMA结合在一起是一种有前途的方法，可以进行表现的重复分布式键值商店（KVSS）。但是，当应用于PM KVSS时，现有的复制方法无法正常工作：1）使用RPC在备份处诱导软件排队和执行，从而增加了请求延迟； 2）使用单方面的RDMA写入会导致许多小PM写入流，从而在PM上导致严重的设备级写入放大（DLWA）。在本文中，我们提出了Rowan，Rowan是一种有效的RDMA抽象来处理PM KVSS中的复制。它集合从不同的服务器写入并发远程写入，并以顺序（因此DLWA）和单方面（因此低潜伏期）方式将这些写入PM。我们通过现成的RDMA NICS认识到Rowan。此外，我们构建了Rowan-KV，这是一种使用Rowan进行复制的日志结构PM KV。评估表明，在使用RPC和RDMA写入的PM KVS相比，在写入密集型工作负载下，Rowan-KV的吞吐量增加了1.22倍和1.39倍，并使中位数分别降低了1.77倍和2.11倍，同时很大程度上消除了DLWA。
Combining persistent memory (PM) with RDMA is a promising approach to performant replicated distributed key-value stores (KVSs). However, existing replication approaches do not work well when applied to PM KVSs: 1) Using RPC induces software queueing and execution at backups, increasing request latency; 2) Using one-sided RDMA WRITE causes many streams of small PM writes, leading to severe device-level write amplification (DLWA) on PM. In this paper, we propose Rowan, an efficient RDMA abstraction to handle replication writes in PM KVSs; it aggregates concurrent remote writes from different servers, and lands these writes to PM in a sequential (thus low DLWA) and one-sided (thus low latency) manner. We realize Rowan with off-the-shelf RDMA NICs. Further, we build Rowan-KV, a log-structured PM KVS using Rowan for replication. Evaluation shows that under write-intensive workloads, compared with PM KVSs using RPC and RDMA WRITE for replication, Rowan-KV boosts throughput by 1.22X and 1.39X as well as lowers median PUT latency by 1.77X and 2.11X, respectively, while largely eliminating DLWA.
