当前位置: X-MOL 学术ACM SIGMOD Rec. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Scaling Dynamic Hash Tables on Real Persistent Memory
ACM SIGMOD Record ( IF 1.1 ) Pub Date : 2021-06-18 , DOI: 10.1145/3471485.3471506
Baotong Lu 1 , Xiangpeng Hao 2 , Tianzheng Wang 2 , Eric Lo 1
Affiliation  

Byte-addressable persistent memory (PM) brings hash tables the potential of low latency, cheap persistence and instant recovery. The recent advent of Intel Optane DC Persistent Memory Modules (DCPMM) further accelerates this trend. Many new hash table designs have been proposed, but most of them were based on emulation and perform sub-optimally on real PM. They were also piecewise and partial solutions that side-stepped many important properties, in particular good scalability, high load factor and instant recovery.

中文翻译:

在真实持久内存上扩展动态哈希表

字节可寻址持久内存 (PM) 为哈希表带来了低延迟、廉价持久性和即时恢复的潜力。英特尔傲腾 DC 持久内存模块 (DCPMM) 的最新出现进一步加速了这一趋势。已经提出了许多新的哈希表设计,但其中大多数是基于仿真的,并且在实际 PM 上的性能并不理想。它们也是分段和部分解决方案,避开了许多重要属性,特别是良好的可扩展性、高负载因子和即时恢复。
更新日期:2021-06-18
down
wechat
bug