Enhancing KiWi - Scalable Concurrent Key-Value Map

09/07/2017
by   Assaf Yifrach, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/27/2019

Truly Concurrent Bisimilarities are Game Equivalent

We design games for truly concurrent bisimilarities, including strongly ...
research
09/04/2018

A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries

Graph algorithms applied in many applications, including social networks...
research
08/05/2021

HIPPODROME: Data Race Repair using Static Analysis Summaries

Implementing bug-free concurrent programs is a challenging task in moder...
research
04/08/2020

Composing and Decomposing Op-Based CRDTs with Semidirect Products

Operation-based Conflict-free Replicated Data Types (CRDTs) are eventual...
research
07/27/2023

Wait-Free Updates and Range Search using Uruv

CRUD operations, along with range queries make a highly useful abstract ...
research
09/18/2022

Infrared: A Meta Bug Detector

The recent breakthroughs in deep learning methods have sparked a wave of...

Please sign up or login with your details

Forgot password? Click here to reset