A lock-free, concurrent, and incremental stack scanning mechanism for garbage collectors

doi:10.1145/1618525.1618527

A lock-free, concurrent, and incremental stack scanning mechanism for garbage collectors

Full Text:

Pdf

Buy this Article

Authors:	Gabriel Kliot	Microsoft Research, Redmond, WA
	Erez Petrank	Technion - Israel Institute of Technology, Haifa, Israel
	Bjarne Steensgaard	Microsoft, Redmond, WA

Published in:

	· Newsletter
	ACM SIGOPS Operating Systems Review archive
	Volume 43 Issue 3, July 2009 Pages 3-13 ACM New York, NY, USA table of contents doi>10.1145/1618525.1618527

	2009 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 19 · Downloads (cumulative): 233 · Citation Count: 1

Tools and Resources

Buy this Article
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms design dynamic storage management garbage collection incremental and concurrent garbage collection lock-free data structures memory management object-oriented programming performance reliability stack scanning

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder