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

Tao CAI, Pengfei GAO, Dejiao NIU, Yueming MA, Tianle LEI, Jianfei DAI

PDF(2117 KB)
PDF(2117 KB)
Front. Inform. Technol. Electron. Eng ›› 2023, Vol. 24 ›› Issue (5) : 703-715. DOI: 10.1631/FITEE.2200462
Orginal Article
Orginal Article

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

Author information +
History +

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%.

Keywords

Extendible hashing / Non-volatile memory (NVM) / High concurrency

Cite this article

Download citation ▾
Tao CAI, Pengfei GAO, Dejiao NIU, Yueming MA, Tianle LEI, Jianfei DAI. NEHASH: high-concurrency extendible hashing for non-volatile memory. Front. Inform. Technol. Electron. Eng, 2023, 24(5): 703‒715 https://doi.org/10.1631/FITEE.2200462

RIGHTS & PERMISSIONS

2023 Zhejiang University Press
PDF(2117 KB)

Accesses

Citations

Detail

Sections
Recommended

/