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 piece-wise and partial solutions that side-step many important properties, in particular good scalability, high load factor and instant recovery. We present Dash, a holistic approach to building dynamic and scalable hash tables on real PM hardware with all the aforementioned properties. Based on Dash, we adapted two popular dynamic hashing schemes (extendible hashing and linear hashing). On a 24-core machine with Intel Optane DCPMM, we show that compared to state-of-the-art, Dash-enabled hash tables can achieve up to ~3.9X higher performance with up to over 90% load factor and an instant recovery time of 57ms regardless of data size.
翻译:平方位可处理的持久性内存(PM)带来散列表格,显示低延迟、低廉持久性和即时恢复的潜力。最近Intel Optane DC持久性内存模块(DCPM)的出现进一步加速了这一趋势。提出了许多新的散列表设计,但大多数都是基于模拟和在真实的 PM 上进行亚优美操作。它们也是片断和局部的解决方案,可以侧向许多重要属性,特别是良好的可缩放性、高负载因子和即时恢复。我们提出了Dash,这是在与上述所有属性一起在实际的 PM 硬件上构建动态和可缩放散列散列表的综合办法。基于 Dash,我们调整了两种流行的动态散列计划(可扩展散列和线性散列 散列 ) 。 在印有 Intel Optane DCPM 的24核心机器上,我们显示,与最新数据相比,Dash 驱动的散列表可以达到~3.9X 更高的性, 90%以上载因负因负因数而立即恢复57米。