Lock-free reference counting

被引:37
|
作者
Detlefs, DL [1 ]
Martin, PA [1 ]
Moir, M [1 ]
Steele, GL [1 ]
机构
[1] Sun Microsyst Labs, Burlington, MA 01803 USA
关键词
lockfree synchronization; reference counting; memory management; dynamic data structures;
D O I
10.1007/s00446-002-0079-z
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Assuming the existence of garbage collection makes it easier to design implementations of dynamic-sized concurrent data structures. However, this assumption limits their applicability. We present a methodology that, for a significant class of data structures, allows designers to first tackle the easier problem of designing a garbage-collection-dependent implementation, and then apply our methodology to achieve a garbage-collection-independent one. Our methodology is based on the well-known reference counting technique, and employs the double compare-and-swap operation.
引用
收藏
页码:255 / 271
页数:17
相关论文
共 50 条
  • [1] Lock-free reference counting
    David L. Detlefs
    Paul A. Martin
    Mark Moir
    Guy L. Steele Jr.
    Distributed Computing, 2002, 15 : 255 - 271
  • [2] 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
  • [3] 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
  • [4] Lock-free queues
    Marginean, Petru
    DR DOBBS JOURNAL, 2008, 33 (07): : 43 - 47
  • [5] Lock-free collective operations
    Supalov, A
    RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE, 2003, 2840 : 276 - 285
  • [6] Lock-free Cuckoo Hashing
    Nhan Nguyen
    Tsigas, Philippas
    2014 IEEE 34TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2014), 2014, : 627 - 636
  • [7] Lock-Free Hopscotch Hashing
    Kelly, Robert
    Pearlmutter, Barak A.
    Maguire, Phil
    SYMPOSIUM ON ALGORITHMIC PRINCIPLES OF COMPUTER SYSTEMS, APOCS, 2020, : 45 - 59
  • [8] Mostly lock-free malloc
    Dice, D
    Garthwaite, A
    ACM SIGPLAN NOTICES, 2003, 38 (02) : 269 - 280
  • [9] 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
  • [10] 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