Skip to main content
Log in

NEHASH: high-concurrency extendible hashing for non-volatile memory

NEHASH:面向非易失性内存的高并发可扩展哈希

  • Research Article
  • Published:
Frontiers of Information Technology & Electronic Engineering Aims and scope Submit manuscript

Abstract

Extendible hashing is an effective way to manage increasingly large file system metadata, but it suffers from low concurrency and lack of optimization for non-volatile memory (NVM). In this paper, a multilevel hash directory based on lazy expansion is designed to improve the concurrency and efficiency of extendible hashing, and a hash bucket management algorithm based on groups is presented to improve the efficiency of hash key management by reducing the size of the hash bucket, thereby improving the performance of extendible hashing. Meanwhile, a hierarchical storage strategy of extendible hashing for NVM is given to take advantage of dynamic random access memory (DRAM) and NVM. Furthermore, on the basis of the device driver for Intel Optane DC Persistent Memory, the prototype of high-concurrency extendible hashing named NEHASH is implemented. Yahoo cloud serving benchmark (YCSB) is used to test and compare with CCEH, level hashing, and cuckoo hashing. The results show that NEHASH can improve read throughput by up to 16.5% and write throughput by 19.3%.

摘要

可扩展哈希是管理越来越庞大的文件系统元数据的有效方式,但其存在并发度较低 和缺乏针对非易失内存(NVM)的优化等问题。本文设计了基于惰性扩展的多层哈希目录, 以提高哈希目录管理的并发度和效率;设计了基于组的哈希桶管理算法,通过缩小哈希桶 大小,提高哈希键管理的效率,从而提高动态可扩展哈希的性能;利用动态随机存取存储 器(DRAM)和NVM各自的优势设计了面向NVM的分层存储策略;并在英特尔傲腾持久 内存(Intel Optane DC Persistent Memory)及其驱动的基础上,实现了面向NVM高并发可 扩展哈希的原型,称为NEHASH。使用雅虎云服务基准测试工具(YCSB)与缓存行意识 的可扩展哈希(CCEH)、级别哈希(level hashing)、布谷鸟哈希(cuckoo hashing)等进 行比较,结果显示NEHASH最高能提高16.5%的读吞吐率和19.3%的写吞吐率。

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Data availability

The data that support the findings of this study are available from the corresponding authors upon reasonable request.

References

Download references

Author information

Authors and Affiliations

Authors

Contributions

Tao CAI designed the research. Tao CAI and Pengfei GAO processed the data. Tao CAI drafted the paper. Dejiao NIU. Yueming MA, Tianle LEI, and Jianfei DAI helped organize the paper. Tao CAI and Pengfei GAO revised and finalized the paper.

Corresponding authors

Correspondence to Tao Cai  (蔡涛) or Pengfei Gao  (高鹏飞).

Additional information

Compliance with ethics guidelines

Tao CAI, Pengfei GAO, Dejiao NIU, Yueming MA, Tianle LEI, and Jianfei DAI declare that they have no conflict of interest.

Project supported by the National Natural Science Foundation of China (No. 61806086) and the National Key R&D Program of China (No. 2018YFB0804204)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cai, T., Gao, P., Niu, D. et al. NEHASH: high-concurrency extendible hashing for non-volatile memory. Front Inform Technol Electron Eng 24, 703–715 (2023). https://doi.org/10.1631/FITEE.2200462

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/FITEE.2200462

Key words

CLC number

关键词

Navigation