Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

I
ISPAN
2005
8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)
Abstract - Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Anders Gidenstam Articles by Marina Papatriantafilou Articles by Hakan Sundell Articles by Philippas Tsigas

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)

Las Vegas, Nevada, USA

December 07-December 09

ISBN: 0-7695-2509-1

	ASCII Text	x
	Anders Gidenstam, Marina Papatriantafilou, Hakan Sundell, Philippas Tsigas, "Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 202-207, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2005.

	BibTex	x
	@article{ 10.1109/ISPAN.2005.42, author = {Anders Gidenstam and Marina Papatriantafilou and Hakan Sundell and Philippas Tsigas}, title = {Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2005}, issn = {1087-4089}, pages = {202-207}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2005.42}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting SN - 1087-4089 SP202 EP207 A1 - Anders Gidenstam, A1 - Marina Papatriantafilou, A1 - Hakan Sundell, A1 - Philippas Tsigas, PY - 2005 KW - null VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

Anders Gidenstam, Chalmers University of Technology and Goteborg University, Sweden

Marina Papatriantafilou, Chalmers University of Technology and Goteborg University, Sweden

Hakan Sundell, Chalmers University of Technology and Goteborg University, Sweden

Philippas Tsigas, Chalmers University of Technology and Goteborg University, Sweden

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2005.42

We present an efficient and practical lock-free implementation of a memory reclamation scheme based on reference counting, aimed for use with arbitrary lock-free dynamic data structures. The scheme guarantees the safety of local as well as global references, supports arbitrary memory reuse, uses atomic primitives which are available in modern computer systems and provides an upper bound on the memory prevented for reuse. To the best of our knowledge, this is the first lock-free algorithm that provides all of these properties. Experimental results indicate significant performance improvements for lock-free algorithms of dynamic data structures that require strong garbage collection support.

Citation:

Anders Gidenstam, Marina Papatriantafilou, Hakan Sundell, Philippas Tsigas, "Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting," ispan, pp.202-207, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.