An Efficient Wait-free Resizable Hash Table
Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars

TL;DR
This paper introduces a wait-free resizable hash table that maintains high throughput and natural parallelism, outperforming existing lock-free hash tables especially when resizing is infrequent.
Contribution
The paper presents a novel wait-free hash table design that enables efficient resizing without locks, improving concurrency and performance over prior lock-free approaches.
Findings
Outperforms existing lock-free hash tables in common cases
Provides stronger progress guarantees
Achieves high throughput at large core counts
Abstract
This paper presents an efficient wait-free resizable hash table. To achieve high throughput at large core counts, our algorithm is specifically designed to retain the natural parallelism of concurrent hashing, while providing wait-free resizing. An extensive evaluation of our hash table shows that in the common case where resizing actions are rare, our implementation outperforms all existing lock-free hash table implementations while providing a stronger progress guarantee.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Network Packet Processing and Optimization · Cryptographic Implementations and Security
