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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: January 2002 / Accepted: March 2002
Rights and permissions
About this article
Cite this article
Detlefs, D., Martin, P., Moir, M. et al. Lock-free reference counting. Distrib Comput 15, 255–271 (2002). https://doi.org/10.1007/s00446-002-0079-z
Issue Date:
DOI: https://doi.org/10.1007/s00446-002-0079-z