Avoiding Thread Stalls and Switches in Key-Value Stores: New Latch-Free Techniques and More

TL;DR

This paper introduces a latch-free approach using notices to significantly reduce thread stalls and switches in key-value stores by exploiting delta record updating, improving performance during concurrent data access.

Contribution

The paper presents a novel latch-free technique called notices that reduces wasted work and avoids thread stalls in key-value store index maintenance.

Findings

Notices effectively reduce thread stalls during B-tree index updates.

Latch-free techniques with notices outperform latch-based methods under high contention.

The approach minimizes wasted work in concurrent key-value store operations.

Abstract

A significant impediment to high performance in key-value stores is the high cost of thread switching or stalls. While there are many sources for this, a major one is the contention for resources. And this cost increases with load as conflicting operations more frequently try to access data concurrently. Traditional latch-based approaches usually handle these situations by blocking one or more contending threads. Latch-free techniques can avoid this behavior. But the payoff may be limited if latch-free techniques require executing wasted work. In this paper, we show how latch-free techniques exploit delta record updating and can significantly reduce wasted work by using notices, a new latch-free approach. This paper explains how notices work and can solve B-tree index maintenance problems, while avoiding thread switches or stalls. Other opportunities for avoiding thread switches or stalls are also discussed.