Lock-Free Reference Counting (2001)
| Venue: | in Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing |
| Citations: | 22 - 7 self |
BibTeX
@INPROCEEDINGS{Detlefs01lock-freereference,
author = {David L. Detlefs and Paul A. Martin and Mark Moir and Guy L. Steele and Jr.},
title = {Lock-Free Reference Counting},
booktitle = {in Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing},
year = {2001},
pages = {190--199}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Assuming the existence of garbage collection makes it easier to design implementations of 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 garbagecollection -dependent implementation, and then apply our methodology to achieve a garbage-collectionindependent one. Our methodology is based on the well-known reference counting technique, and employs the double compare-and-swap operation.
