The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jan. 31, 2006
Filed:
Apr. 18, 2001
David L. Detlefs, Westford, MA (US);
Paul A. Martin, Arlington, MA (US);
Mark S. Moir, Somerville, MA (US);
Guy L. Steele, Jr., Lexington, MA (US);
David L. Detlefs, Westford, MA (US);
Paul A. Martin, Arlington, MA (US);
Mark S. Moir, Somerville, MA (US);
Guy L. Steele, Jr., Lexington, MA (US);
Sun Microsystems, Inc., Sunnyvale, CA (US);
Abstract
We present a methodology for transforming concurrent data structure implementations that depend on garbage collection to equivalent implementations that do not. Assuming the existence of garbage collection makes it easier to design implementations of concurrent data structures, particularly because it eliminates the well-known ABA problem. However, this assumption limits their applicability. Our results demonstrate that, for a significant class of data structures, designers can first tackle the easier problem of an implementation that does depend on garbage collection, and then apply our methodology to achieve a garbage-collection-independent implementation. Our methodology is based on the well-known reference counting technique, and employs the double compare-and-swap operation.