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.
@article{arxiv.2204.09624,
title = {An Efficient Wait-free Resizable Hash Table},
author = {Panagiota Fatourou and Nikolaos D. Kallimanis and Thomas Ropars},
journal= {arXiv preprint arXiv:2204.09624},
year = {2022}
}