Searching for "Lock-free reference counting." – sorted by Relevance.
-
Lock-Free Reference Counting
- Lock-Free Reference Counting # David L. Detlefs Paul A. Martin Mark Moir Guy L. Steele Jr. Sun
- Cited by 16 (4 self) – Add To MetaCart
-
DCAS-based concurrent deques supporting bulk allocation
- called Lock-Free Reference Counting (LFRC) for converting a large class of GC-dependent implementations
- Cited by 13 (4 self) – Add To MetaCart
-
Making lockless synchronization fast: Performance implications of memory reclamation
- to PTB as well. 2.2.2 Lock-Free Reference Counting (LFRC) Lock-free reference counting (LFRC) is a well
- Cited by 2 (1 self) – Add To MetaCart
-
www.elsevier.com/locate/jpdc Performance of memory reclamation for lockless synchronization �
- -pointer-based reclamation (HPBR) [29,30], and lock-free reference counting (LFRC) [39,32]. In this section, we provide
- Add To MetaCart
-
DCAS is not a silver bullet for nonblocking algorithm design
- et al. [4] present a storage reclamation technique called lock-free reference counting (LFRC). LFRC
- Cited by 9 (0 self) – Add To MetaCart
-
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap
- would be sufficient for our needs. There exists a general lock-free reference counting scheme by Detlefs
- Add To MetaCart
-
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects
- processors. 2) Lock-free reference counting methods [29], [3], which are inefficient and use unavailable
- Add To MetaCart
-
Two-Handed Emulation: How to build non-blocking implementations of complex data-structures using DCAS
- to describe each operation. Garbage collection (or equivalent techniques such as lock-free reference counting
- Cited by 18 (0 self) – Add To MetaCart

