Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Memory management in lock-free data structures remains a major challenge in concurrent programming. Design techniques including… 
2017
2017
The verification of linearizability -- a key correctness criterion for concurrent objects -- is based on trace refinement whose… 
2017
2017
Memory management is a critical component in almost all shared-memory, concurrent data structures and algorithms, consisting in… 
2015
2015
This paper describes algorithms for a lock-free dictionary and a waitfree queue. The queue improves on a previous result by Kogan… 
2014
2014
VeriFast is a verifier for single-threaded and multithreaded C and Java programs. It takes a C or Java program annotated with… 
2013
2013
Memory management is one of the most complex aspects of modern concurrent algorithms, and various techniques proposed for it… 
2012
2012
Although there are a lot of optimized concurrent algorithms for lists, queues, stacks, hash tables and other common data… 
2011
2011
Lock-free objects offer significant performance and reliability benefits over conventional lock-based counterparts. However, the… 
2010
2010
Software transactional memory (STM) is one of the promising models in parallel programming for multi-core processor system and… 
2005
2005
There is not yet a formal statement of RCU (read-copy update) semantics. While this lack has thus far not been an impediment to…