Efficient Lock-Free Durable Sets

TL;DR

This paper introduces a new lock-free durable set design optimized for non-volatile memory, achieving up to 3.3 times better performance than existing solutions, crucial for future memory architectures.

Contribution

It presents a novel lock-free approach for durable sets and constructs the most efficient durable hash tables to date.

Findings

Performance improvement factor of up to 3.3x over existing technology

First lock-free durable set implementation optimized for non-volatile memory

Demonstrates practical viability for future memory architectures

Abstract

Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures. Durable concurrent data structures for non-volatile memories are essential building blocks for constructing adequate software for use with these architectures. In this paper, we propose a new approach for durable concurrent sets and use this approach to build the most efficient durable hash tables available today. Evaluation shows a performance improvement factor of up to 3.3x over existing technology.