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.

 
Web www.patentalert.com

< Generating mask patterns for alternating phase-shift mask lithography

< System for preventing periodic load balancing if processor associated with lightest local run queue has benefited from idle processor load balancing within a determined time period

> System and method for introducing enhanced features into a java swing application program interface

> Identifying a distributed denial of service (DDoS) attack within a network and defending against such an attack

~ 00234