Enhancing KiWi - Scalable Concurrent Key-Value Map

TL;DR

This paper improves the KiWi concurrent sorted map by fixing bugs, adding new linearizable operations, and evaluating its performance to ensure reliability and efficiency in concurrent environments.

Contribution

The paper introduces bug fixes, new linearizable operations, and performance evaluation for the KiWi map, enhancing its correctness and usability in concurrent systems.

Findings

Bug fixes improved linearizability

New operations provide bounds on size

Performance evaluation confirms efficiency

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.