Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations
Data Structures and Algorithms
2017-12-29 v1
Abstract
Ctrie is a scalable concurrent non-blocking dictionary data structure, with good cache locality, and non-blocking linearizable iterators. However, operations on most existing concurrent hash tries run in O(log n) time. In this technical report, we extend the standard concurrent hash-tries with an auxiliary data structure called a cache. The cache is essentially an array that stores pointers to a specific level of the hash trie. We analyze the performance implications of adding a cache, and prove that the running time of the basic operations becomes O(1).
Cite
@article{arxiv.1712.09636,
title = {Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations},
author = {Aleksandar Prokopec},
journal= {arXiv preprint arXiv:1712.09636},
year = {2017}
}