Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,979,029 papers from all fields of science
Search
Sign In
Create Free Account
Hazard pointer
In a multithreaded computing environment, hazard pointers are one approach to solving the problems posed by dynamic memory management of the nodes in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
ABA problem
Compare-and-swap
Computer science
Concurrent data structure
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Safe Deferred Memory Reclamation with Types
Ismail Kuru
,
Colin S. Gordon
European Symposium on Programming
2018
Corpus ID: 53966864
Memory management in lock-free data structures remains a major challenge in concurrent programming. Design techniques including…
Expand
2017
2017
Verifying Concurrent Stacks by Divergence-Sensitive Bisimulation
Xiaoxiao Yang
,
J. Katoen
,
Huimin Lin
,
Hao Wu
arXiv.org
2017
Corpus ID: 5043567
The verification of linearizability -- a key correctness criterion for concurrent objects -- is based on trace refinement whose…
Expand
2017
2017
A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it)
Manuel Pöter
,
J. Träff
arXiv.org
2017
Corpus ID: 30846288
Memory management is a critical component in almost all shared-memory, concurrent data structures and algorithms, consisting in…
Expand
2015
2015
A Concurrent Dictionary and Wait-Free Queue from Compare and Swap
William Morriss
2015
Corpus ID: 7519507
This paper describes algorithms for a lock-free dictionary and a waitfree queue. The queue improves on a previous result by Kogan…
Expand
2014
2014
Shared boxes: rely-guarantee reasoning in VeriFast
Jan Smans
,
Dries Vanoverberghe
,
Dominique Devriese
,
B. Jacobs
,
Frank Piessens
2014
Corpus ID: 15240394
VeriFast is a verifier for single-threaded and multithreaded C and Java programs. It takes a C or Java program annotated with…
Expand
2013
2013
Verifying Concurrent Memory Reclamation Algorithms with Grace
Alexey Gotsman
,
N. Rinetzky
,
Hongseok Yang
European Symposium on Programming
2013
Corpus ID: 3147611
Memory management is one of the most complex aspects of modern concurrent algorithms, and various techniques proposed for it…
Expand
2012
2012
Binary Trees Implementations Comparison for Multicore Programming
Baptiste Wicht
2012
Corpus ID: 8833747
Although there are a lot of optimized concurrent algorithms for lists, queues, stacks, hash tables and other common data…
Expand
2011
2011
Active Hazard Pointers : Leak-Free Memory Reclamation for Lock-Free Objects
Koyfman Slava
,
Shubin Hani
2011
Corpus ID: 53469319
Lock-free objects offer significant performance and reliability benefits over conventional lock-based counterparts. However, the…
Expand
2010
2010
The Design and Implement of Memory Manager in STM
Zhang Ping
,
Li Qingbao
,
Huang Guorui
,
Zeng Guangyu
Ninth International Symposium on Distributed…
2010
Corpus ID: 17093911
Software transactional memory (STM) is one of the promising models in parallel programming for multi-core processor system and…
Expand
2005
2005
RCU Semantics: A First Attempt
P. McKenney
,
J. Walpole
2005
Corpus ID: 11545646
There is not yet a formal statement of RCU (read-copy update) semantics. While this lack has thus far not been an impediment to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE