HackerPapers

arXiv:1909.02852cs.DC

Efficient Lock-Free Durable Sets

Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, Erez Petrank

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
Journal reference
DOI
Subjects
cs.DCDistributed, Parallel, and Cluster Computing cs.DSData Structures and Algorithms cs.PFPerformance

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Dec 2019 to Dec 2019.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Efficient lock-free durable sets 1 comment

    • Lock-free data structures tend to use the compare-and-swap atomic operation as a primitive: https://en.wikipedia.org/wiki/Compare-and-swap You provide three values to a CAS operation: the memory address you want to change, the value you expect to be there and the new value you…

      scott_sView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.