Every Data Structure Deserves Lock-Free Memory Reclamation

被引:0
|
作者
Cohen, Nachshon [1 ]
机构
[1] Ecole Polytech Fed Lausanne, Lausanne, Switzerland
关键词
Lock-free memory management; Hazard Pointers; Optimistic Access;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Memory-management support for lock-free data structures is well known to be a tough problem. Recent work has successfully reduced the overhead of such schemes. However, applying memory-management support to a data structure remains complex and, in many cases, requires redesigning the data structure. In this paper, we present the first lock-free memory-management scheme that is applicable to general (arbitrary) lock-free data structures and that can be applied automatically via a compiler plug-in. In addition to the simplicity of incorporating to data structures, this scheme provides low overhead and does not rely on the lock freedom of any OS services.
引用
收藏
页数:24
相关论文
共 50 条
  • [1] Every Data Structure Deserves Lock-Free Memory Reclamation
    Cohen, Nachshon
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2018, 2
  • [2] Automatic Memory Reclamation for Lock-Free Data Structures
    Cohen, Nachshon
    Petrank, Erez
    ACM SIGPLAN NOTICES, 2015, 50 (10) : 260 - 279
  • [3] Memory Reclamation Methods for Lock-Free Hash Tries
    Moreno, Pedro
    Areias, Miguel
    Rocha, Ricardo
    2019 31ST INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD 2019), 2019, : 188 - 195
  • [4] Snapshot-Free, Transparent, and Robust Memory Reclamation for Lock-Free Data Structures
    Nikolaev, Ruslan
    Ravindran, Binoy
    PROCEEDINGS OF THE 42ND ACM SIGPLAN INTERNATIONAL CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '21), 2021, : 987 - 1002
  • [5] Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis
    Meyer, Roland
    Wolff, Sebastian
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2019, 3 (POPL):
  • [6] Pointer Life Cycle Types for Lock-Free Data Structures with Memory Reclamation
    Meyer, Roland
    Wolff, Sebastian
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (POPL):
  • [7] Transactional memory as an approach to building a lock-free data structure
    Pyankov, S. A.
    Babichev, S. L.
    7TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT (ITQM 2019): INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT BASED ON ARTIFICIAL INTELLIGENCE, 2019, 162 : 76 - 81
  • [8] Hazard pointers: Safe memory reclamation for lock-free objects
    Michael, MM
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2004, 15 (06) : 491 - 504
  • [9] 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
  • [10] On the implementation of memory reclamation methods in a lock-free hash trie design
    Moreno, Pedro
    Areias, Miguel
    Rocha, Ricardo
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2021, 155 : 1 - 13