Efficient Lock-Free Durable Sets

被引：35

作者：

Zuriel, Yoav ^{[1
]}

Friedman, Michal ^{[1
]}

Sheffi, Gali ^{[1
]}

Cohen, Nachshon ^{[2
]}

Petrank, Erez ^{[1
]}

机构：

[1] Technion, CS Dept, Jerusalem, Israel

[2] Amazon, Jerusalem, Israel

来源：

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL | 2019年 / 3卷 / OOPSLA期

基金：

以色列科学基金会;

关键词：

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

D O I：

10.1145/3360554

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页数：26

共 46 条

[1] Forkscan: Conservative Memory Reclamation for Modern Operating Systems [J].

Alistarh, Dan ;

Leiserson, William ;

Matveev, Alexander ;

Shavit, Nir .

PROCEEDINGS OF THE TWELFTH EUROPEAN CONFERENCE ON COMPUTER SYSTEMS (EUROSYS 2017), 2017, :483-498

[2]

[Anonymous], 2008, ART MULTIPROCESSOR P

[3] Let's Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems [J].

Arulraj, Joy ;

Pavlo, Andrew ;

Dulloor, Subramanya R. .

SIGMOD'15: PROCEEDINGS OF THE 2015 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2015, :707-722

[4]

Avni H, 2016, PROC VLDB ENDOW, V10, P409

[5]

Balmau Oana., 2016, P 28 ACM S PARALLELI, P349, DOI [10.1145/2935764.2935790, DOI 10.1145/2935764.2935790]

[6] Delay-Free Concurrency on Faulty Persistent Memory [J].

Ben-David, Naama ;

Blelloch, Guy E. ;

Friedman, Michal ;

Wei, Yuanhao .

SPAA'19: PROCEEDINGS OF THE 31ST ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURESS, 2019, 2019, :253-264

[7] Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way [J].

Brown, Trevor .

PODC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2015, :261-270

[8]

Chakrabarti DR, 2014, ACM SIGPLAN NOTICES, V49, P433, DOI [10.1145/2660193.2660224, 10.1145/2714064.2660224]

[9]

Coburn J, 2011, ACM SIGPLAN NOTICES, V46, P105, DOI [10.1145/1961296.1950380, 10.1145/1961295.1950380]

[10]

Cohen N, 2018, P ACM PROGRAM LANG, V2, DOI 10.1145/3276513

← 1 2 3 4 5 →