Software Open Access
Concurrent non-blocking hash tries have good cache locality,
and horizontally scalable operations. However, operations
on most existing concurrent hash tries run in O (log n) time.
This artifact contains present a novel
lock-free concurrent hash trie implementation that exerts less pressure
on the memory allocator. This hash trie is augmented with
a quiescently consistent cache, which permits the basic operations to run in expected O (1) time.
On typical workloads, our implementation demonstrates up
to 5× performance improvements with respect to the previous hash trie variants.