Efficient lock-free durable sets

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

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Article numberA128
JournalProceedings of the ACM on Programming Languages
Issue numberOOPSLA
StatePublished - Oct 2019


  • Concurrent Data Structures
  • Durable Linearizability
  • Durable Sets
  • Hash Maps
  • Lock Freedom
  • Non-Volatile Memory

All Science Journal Classification (ASJC) codes

  • Software
  • Safety, Risk, Reliability and Quality


Dive into the research topics of 'Efficient lock-free durable sets'. Together they form a unique fingerprint.

Cite this