Author:
Li Wenhai,Cheng Zhiling,Chen Yuan,Li Ao,Deng Lingfeng
Abstract
AbstractConcurrent hash tables are one of the fundamental building blocks for cloud computing. In this paper, we introduce lock-free modifications to in-memory bucketized cuckoo hashing. We present a novel concurrent strategy in designing a lock-free hash table, called LFBCH, that paves the way towards scalability and high space efficiency. To the best of our knowledge, this is the first attempt to incorporate lock-free technology into in-memory bucketized cuckoo hashing, while still providing worst-case constant-scale lookup time and extremely high load factor. All of the operations over LFBCH, such as get, put, “kick out” and rehash, are guaranteed to be lock-free, without introducing notorious problems like false miss and duplicated key. The experimental results indicate that under mixed workloads with up to 64 threads, the throughput of LFBCH is 14%–360% higher than other popular concurrent hash tables.
Publisher
Springer Nature Switzerland
Reference18 articles.
1. Armbrust, M., et al.: A view of cloud computing. Commun. ACM 53(4), 50–58 (2010)
2. Barnes, G.: A method for implementing lock-free shared-data structures. In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 261–270 (1993)
3. Chandramouli, B., Prasaad, G., Kossmann, D., Levandoski, J., Hunter, J., Barnett, M.: Faster: a concurrent key-value store with in-place updates. In: Proceedings of the 2018 International Conference on Management of Data, pp. 275–290 (2018)
4. Chen, J., et al.: Hotring: a hotspot-aware in-memory key-value store. In: FAST, pp. 239–252 (2020)
5. Chen, Z., Hua, Y., Ding, B., Zuo, P.: Lock-free concurrent level hashing for persistent memory. In: Proceedings of the 2020 USENIX Conference on USENIX Annual Technical Conference, pp. 799–812 (2020)