English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

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

MPS-Authors
/persons/resource/persons44497

Gidenstam,  Anders
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45161

Papatriantafilou,  Marina
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45640

Tsigas,  Philippas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Gidenstam, A., Papatriantafilou, M., Sundell, H., & Tsigas, P. (2009). Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting. IEEE Transactions on Parallel and Distributed Systems, 20(8), 1173-1187. Retrieved from http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.167.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1831-E
Abstract
There is no abstract available