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

Authors

page 1

page 2

page 3

page 4

06/27/2019

Truly Concurrent Bisimilarities are Game Equivalent

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

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

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

HIPPODROME: Data Race Repair using Static Analysis Summaries

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

Composing and Decomposing Op-Based CRDTs with Semidirect Products

Operation-based Conflict-free Replicated Data Types (CRDTs) are eventual...
11/17/2020

Automatic Microprocessor Performance Bug Detection

Processor design validation and debug is a difficult and complex task, w...
10/23/2018

Some Challenges of Specifying Concurrent Program Components

The purpose of this paper is to address some of the challenges of formal...
06/22/2020

Scalable Range Locks for Scalable Address Spaces and Beyond

Range locks are a synchronization construct designed to provide concurre...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.