Article,

Lock-Free Reference Counting

, , , and .
Distributed Computing, 15 (4): 255--271 (Dec 1, 2002)
DOI: 10.1007/s00446-002-0079-z

Abstract

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.

Tags

Users

  • @gron

Comments and Reviews