Dynamic-sized lock-free data structures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Dynamic-sized lock-free data structures

Full text

Pdf (94 KB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twenty-first annual symposium on Principles of distributed computing table of contents

Monterey, California

SESSION: Session 4 (brief announcements) table of contents

Pages: 131 - 131

Year of Publication: 2002

ISBN:1-58113-485-1

Authors

Maurice Herlihy	Brown University, Providence, RI
Victor Luchangco	Sun Microsystem Laboratories, Burlington, MA
Paul Martin	Sun Microsystem Laboratories, Burlington, MA
Mark Moir	Sun Microsystem Laboratories, Burlington, MA

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 30, Citation Count: 5

Additional Information:

references cited by collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/571825.571847 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	David L. Detlefs , Paul A. Martin , Mark Moir , Guy L. Steele, Jr., Lock-free reference counting, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, p.190-199, August 2001, Newport, Rhode Island, United States [doi>10.1145/383962.384016]
	2	M. Herlihy, V. Luchangco, P. Martin, and M. Moir. Dynamic-sized lock-free data structures. Technical Report TR-2002-110, Sun Microsystems Laboratories, 2002.
	3	M. Herlihy, V. Luchangco, and M. Moir. The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures. Technical Report TR-2002-112, Sun Microsystems Laboratories, 2002.
	4	Maged M. Michael, Safe memory reclamation for dynamic lock-free objects using atomic reads and writes, Proceedings of the twenty-first annual symposium on Principles of distributed computing, July 21-24, 2002, Monterey, California [doi>10.1145/571825.571829]

CITED BY 5

	Michael Greenwald, Two-handed emulation: how to build non-blocking implementations of complex data-structures using DCAS, Proceedings of the twenty-first annual symposium on Principles of distributed computing, July 21-24, 2002, Monterey, California
	Simon Doherty , Maurice Herlihy , Victor Luchangco , Mark Moir, Bringing practical lock-free synchronization to 64-bit applications, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, July 25-28, 2004, St. John's, Newfoundland, Canada
	Maurice Herlihy , Victor Luchangco , Paul Martin , Mark Moir, Nonblocking memory management support for dynamic-sized data structures, ACM Transactions on Computer Systems (TOCS), v.23 n.2, p.146-196, May 2005
	Håkan Sundell , Philippas Tsigas, Lock-free deques and doubly linked lists, Journal of Parallel and Distributed Computing, v.68 n.7, p.1008-1020, July, 2008
	Kevin Klues , Vlado Handziski , Chenyang Lu , Adam Wolisz , David Culler , David Gay , Philip Levis, Integrating concurrency control and energy management in device drivers, ACM SIGOPS Operating Systems Review, v.41 n.6, December 2007

Collaborative Colleagues:

Maurice Herlihy: colleagues

Victor Luchangco: colleagues

Paul Martin: colleagues

Mark Moir: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player