论文标题
有效的无候补可分解哈希表
An Efficient Wait-free Resizable Hash Table
论文作者
论文摘要
本文介绍了有效的无候补可源性哈希表。为了在大型核心计数下实现高通量，我们的算法是专门设计的，可以保留并发哈希的自然并行性，同时提供无候补的调整大小。对我们的哈希表的广泛评估表明，在常见的情况下，在调整操作很少见的情况下，我们的实施实施优于所有现有的无锁哈希表实现，同时提供更强的进度保证。
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.
