The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Hazard pointers: safe memory reclamation for lock-free objects
Abstract
Lock-free objects offer significant performance and reliability advantages over conventional lock-based objects. However, the lack of an efficient portable lock-free method for the reclamation of the memory occupied by dynamic nodes removed from such objects is a major obstacle to their wide use in practice. We present hazard pointers, a memory management methodology that allows memory reclamation for arbitrary reuse. It is very efficient, as demonstrated by our experimental results. It is suitable for user-level applications - as well as system programs - without dependence on special kernel or scheduler support. It is wait-free. It requires only single-word reads and writes for memory access in its core operations. It allows reclaimed memory to be returned to the operating system. In addition, it offers a lock-free solution for the ABA problem using only practical single-word instructions. Our experimental results on a multiprocessor system show that the new methodology offers equal and, more often, significantly better performance than other memory management methods, in addition to its qualitative advantages regarding memory reclamation and independence of special hardware support. We also show that lock-free implementations of important object types, using hazard pointers, offer comparable performance to that of efficient lock-based implementations under no contention and no multiprogramming, and outperform them by significant margins under moderate multiprogramming and/or contention, in addition to guaranteeing continuous progress and availability, even in the presence of thread failures and arbitrary delays.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
Michael, M. M., & Scott, M. L. (1996) · Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 · doi:10.1145/248052.248106 · Cited by 802
Self-citationScheduler activations: effective kernel support for the user-level management of parallelism
Anderson, T. E., Bershad, B. N., Lazowska, E. D., & Levy, H. M. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146944 · Cited by 431
High performance dynamic lock-free hash tables and list-based sets
Michael, M. M. (2002) · Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures · doi:10.1145/564870.564881 · Cited by 413
Self-citationShavit, N., & Touitou, D. (1997) · Distributed Computing · doi:10.1007/s004460050028 · Cited by 402
Dynamic decentralized cache schemes for mimd parallel processors
Rudolph, L., & Segall, Z. (1984) · ACM SIGARCH Computer Architecture News · doi:10.1145/773453.808203 · Cited by 213
Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors
Michael, M. M., & Scott, M. L. (1998) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1998.1446 · Cited by 211
Self-citationDynamic decentralized cache schemes for mimd parallel processors
Rudolph, L., & Segall, Z. (1984) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/800015.808203 · Cited by 119
Detlefs, D., Martin, P. A., Moir, M., et al. (2001) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/383962.384016 · Cited by 78
Cited by
Resources, concurrency, and local reasoning
O’Hearn, P. W. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.12.035 · Cited by 552
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Berdine, J., Calcagno, C., & O’Hearn, P. W. (2006) · Lecture Notes in Computer Science · doi:10.1007/11804192_6 · Cited by 316
Perceus: garbage free reference counting with reuse
Reinking, A., Xie, N., de Moura, L., & Leijen, D. (2021) · Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation · doi:10.1145/3453483.3454032 · Cited by 32
Metadata
- Authors
- Michael, M. M.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2004-06
- Volume
- 15
- Issue
- 6
- Pages
- 491-504
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2100357382
- Cited by
- 508
- References
- 10
- FWCI
- 17.67
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Hazard pointers: safe memory reclamation for lock-free objects. https://app.cochat.ai/papers/10.1109/tpds.2004.8
- The paper
- Michael, M. M. (2004). Hazard pointers: safe memory reclamation for lock-free objects. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2004.8
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.