...
首页> 外文期刊>Future generation computer systems >RHKV: An RDMA and HTM friendly key-value store for data-intensive computing
【24h】

RHKV: An RDMA and HTM friendly key-value store for data-intensive computing

机译:RHKV:RDMA和HTM友好键值存储,用于数据密集型计算

获取原文
获取原文并翻译 | 示例
           

摘要

Serving DRAM as the storage through key–value abstraction has proved as an attractive option, which provides fast data access for data-intensive computing. However, due to the drawbacks of network round trips and requesting conflicts, remote data access over traditional commodity networking technology might incur high latency for the key–value data store. The major performance bottleneck lies in client-side request waiting and server-side I/O overhead. Accordingly, this paper proposesRHKV: a novelRDMA andHTM friendlykey–value store to provide fast and scalable data management by using the designedG-Cuckoohashing scheme. Our work expands the idea as follows: (i) An RHKV client transmits data requests to our improved Cuckoo hashing scheme — G-Cuckoo, which constructs a Cuckoo graph as directed pseudoforests in RHKV server. The RHKV server computes the reply for each data request. The server maintains a bucket-to-vertex mapping and pre-determines the possibility of a loop prior to data insertion. Through the use of this Cuckoo graph, the endless kick-out loop of data insertions that can potentially be experienced in the case of generic Cuckoo hashing can be detected. (ii) Despite messaging primitives are slower than RDMA READs for data requests, RHKV adopts RDMA messaging verbs unconventionally. It leverages rich network semantics and makes full use of RDMA’s high bandwidth and low latency for data access over high-performance RDMA interconnects. (iii) Moreover, in order to ensure the data operation’s atomicity, RHKV strives to utilize the advanced HTM technique. Experimental performance evaluation with YCSB workloads shows that, when basic data operations are conducted, RHKV outperforms several state-of-the-art key–value stores with lower latency and higher throughput.
机译:通过键值抽象将DRAM用作存储设备已被证明是一种有吸引力的选择,它可以为数据密集型计算提供快速的数据访问。但是,由于网络往返和请求冲突的缺点,通过传统商品联网技术进行的远程数据访问可能会导致键值数据存储的高延迟。主要的性能瓶颈在于客户端请求等待和服务器端I / O开销。因此,本文提出了RHKV:一种新颖的RDMA和HTM友好键值存储,可以使用设计的G-Cuckoohashing方案提供快速和可扩展的数据管理。我们的工作将想法扩展如下:(i)RHKV客户端将数据请求传输到我们改进的Cuckoo哈希方案-G-Cuckoo,该方案在RHKV服务器中将Cuckoo图构造为有向伪森林。 RHKV服务器为每个数据请求计算答复。服务器维护存储桶到顶点的映射,并在数据插入之前预先确定循环的可能性。通过使用此Cuckoo图,可以检测到在普通的Cuckoo哈希中可能经历的数据插入的无尽启动循环。 (ii)尽管对于数据请求,消息传递原语比RDMA READs慢,但是RHKV非常规地采用RDMA消息传递动词。它利用丰富的网络语义,并充分利用RDMA的高带宽和低延迟来通过高性能RDMA互连进行数据访问。 (iii)此外,为了确保数据操作的原子性,RHKV努力利用先进的HTM技术。使用YCSB工作负载进行的性能评估实验表明,在执行基本数据操作时,RHKV的性能优于几个最新的键值存储,且延迟时间较短,吞吐量更高。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号