Efficient lock-free durable sets

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

doi:https://doi.org/10.1145/3360554

Efficient lock-free durable sets

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

Computer Science

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Article number	A128
Journal	Proceedings of the ACM on Programming Languages
Volume	3
Issue number	OOPSLA
DOIs	https://doi.org/10.1145/3360554
State	Published - Oct 2019

Keywords

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

Access to Document

https://doi.org/10.1145/3360554

Cite this

@article{950e5eb33bc342d0ac40b266f98ef761,

title = "Efficient lock-free durable sets",

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.",

keywords = "Concurrent Data Structures, Durable Linearizability, Durable Sets, Hash Maps, Lock Freedom, Non-Volatile Memory",

author = "Yoav Zuriel and Michal Friedman and Gali Sheffi and Nachshon Cohen and Erez Petrank",

year = "2019",

month = oct,

doi = "https://doi.org/10.1145/3360554",

language = "الإنجليزيّة",

volume = "3",

journal = "Proceedings of the ACM on Programming Languages",

issn = "2475-1421",

publisher = "Association for Computing Machinery (ACM)",

number = "OOPSLA",

}

TY - JOUR

T1 - Efficient lock-free durable sets

AU - Zuriel, Yoav

AU - Friedman, Michal

AU - Sheffi, Gali

AU - Cohen, Nachshon

AU - Petrank, Erez

PY - 2019/10

Y1 - 2019/10

N2 - 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.

AB - 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.

KW - Concurrent Data Structures

KW - Durable Linearizability

KW - Durable Sets

KW - Hash Maps

KW - Lock Freedom

KW - Non-Volatile Memory

UR - http://www.scopus.com/inward/record.url?scp=85120113313&partnerID=8YFLogxK

U2 - https://doi.org/10.1145/3360554

DO - https://doi.org/10.1145/3360554

M3 - مقالة

SN - 2475-1421

VL - 3

JO - Proceedings of the ACM on Programming Languages

JF - Proceedings of the ACM on Programming Languages

IS - OOPSLA

M1 - A128

ER -

Efficient lock-free durable sets

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this