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

共 50 条

[11] Mostly lock-free malloc
Dice, D
Garthwaite, A
ACM SIGPLAN NOTICES, 2003, 38 (02) : 269 - 280
[12] Lock-free Transactional Vector
Lamar, Kenneth
Peterson, Christina
Dechev, Damian
PROCEEDINGS OF THE ELEVENTH INTERNATIONAL WORKSHOP ON PROGRAMMING MODELS AND APPLICATIONS FOR MULTICORES AND MANYCORES, PMAM 2020, 2020, : 51 - 60
[13] Lock-free reference counting
Detlefs, DL
Martin, PA
Moir, M
Steele, GL
DISTRIBUTED COMPUTING, 2002, 15 (04) : 255 - 271
[14] Lock-Free Locks Revisited
Ben-David, Naama
Blelloch, Guy E.
Wei, Yuanhao
PPOPP'22: PROCEEDINGS OF THE 27TH ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING, 2022, : 278 - 293
[15] Lock-free collective operations
Supalov, Alexander
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2003, 2840 : 276 - 285
[16] Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
Gidenstam, Anders
Papatriantafilou, Marina
Sundell, Hakan
Tsigas, Philippas
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20 (08) : 1173 - 1187
[17] An Efficient Unbounded Lock-Free Queue for Multi-core Systems
Aldinucci, Marco
Danelutto, Marco
Kilpatrick, Peter
Meneghin, Massimiliano
Torquati, Massimo
EURO-PAR 2012 PARALLEL PROCESSING, 2012, 7484 : 662 - 673
[18] Efficient and reliable lock-free memory reclamation based on reference counting
Gidenstam, A
Papatriantafilou, M
Sundell, H
Tsigas, P
8TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2005, : 202 - 207
[19] Lock-free concurrent binomial heaps
Lowe, Gavin
JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2018, 101 : 44 - 87
[20] Lock-free AntNets and their adaptability evaluations
Oida, K
Kataoka, A
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS, 2001, 84 (02): : 51 - 61

← 1 2 3 4 5 →