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

来源：

DISTRIBUTED COMPUTING | 2002年 / 15卷 / 04期

关键词：

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

共 26 条

[21] Software transactional memory [J].