Enhancing KiWi - Scalable Concurrent Key-Value Map
Data Structures and Algorithms
2017-10-16 v2 Distributed, Parallel, and Cluster Computing
Performance
Abstract
We take a relatively fresh wait-free, concurrent sorted map called KiWi, fix and enhance it. First, we test its linearizability by fuzzing and applying Wing&Gong [2] linearizability test. After fixing a few bugs in the algorithm design and its implementation, we enhance it. We design, implement and test two new linearizable operations sizeLowerBound() and sizeUpperBound(). We further compose these operations to create more useful operations. Last, we evaluate the map performance because previous evaluations became obsolete due to our bug corrections.
Cite
@article{arxiv.1709.02225,
title = {Enhancing KiWi - Scalable Concurrent Key-Value Map},
author = {Assaf Yifrach and Niv Gabso},
journal= {arXiv preprint arXiv:1709.02225},
year = {2017}
}
Comments
18 pages, 5 figures