  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.
