D. Detlefs, P. Martin, M. Moir, and G. Steele Jr, Lock-free reference counting, in Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, Aug. 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Practical Multi-Word Compare-and-Swap Operation - Harris, Fraser, Pratt (2002) (6 citations) (Correct)
....longer UNDECIDED) We evaluated two ways of managing these combined descriptors. In the first we assume garbage collection is already provided. In the second we introduce reference counting following Michael and Scott s CAS1 based design [13] the more recent scheme by Detlefs et al. requires CAS2 [5]) We use per thread lists of free descriptors so that, without contention, a descriptor retains affinity for a particular thread. Although this scheme does not allow storage holding descriptors to be re used for other nonreference counted purposes, it is easy to imagine hybrids in which ....
.... use with natural pointer representations and their space reservations still grow with the level of concurrency [14] Our work provides compelling evidence that CAS1 is sufficient for practical implementations of concurrent non blocking data structures (in contrast to other work that mandates CAS2 [4, 5]) In future work we intend to evaluate the effect on application level or system level performance by using CASN to implement many of the algorithms which have so far only been deployed on paper or in simulation. Finally, in their work on Software Transactional Memory, Shavit and Touitou found ....
David L Detlefs, Paul A Martin, Mark Moir, and Guy L Steel Jr. Lock-free reference counting. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, August 2001.
Lock-Free and Practical Deques using Single-Word.. - Sundell, Tsigas (2004) (Correct)
No context found.
D. Detlefs, P. Martin, M. Moir, and G. Steele Jr, Lock-free reference counting, in Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, Aug. 2001.
Two-Handed Emulation: How to build non-blocking implementations.. - Greenwald (2002) (3 citations) (Correct)
No context found.
David L. Detlefs, Paul A. Martin, Mark Moir, and Guy L. Steele Jr. Lock-free reference counting. In Proceedings of the Twentieth Symposium on Principles of Distributed Computing, pages 190-199, August 2001. Newport, Rhode Island.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC