Abstract
The memory reclamation problem is to determine, for any given allocated memory node, when there are no more references to the node, allowing it to be safely returned to the memory management system. In a concurrent context, the memory reclamation problem is highly non-trivial, since there may be more than one thread referencing an allocated node unbeknownst to the other threads.
- Thomas E. Hart, Paul E. McKenney, Angela Demke Brown, and Jonathan Walpole. 2007. Performance of Memory Reclamation for Lockless Synchronization. J. Parallel Distrib. Comput. 67, 12 (2007), 1270--1285. Google Scholar
Digital Library
- Manuel Pöter and Jesper Larsson Träff. 2017. A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it). (2017). arXiv:1712.06134.Google Scholar
- Arch D. Robison. 2013. Policy-Based Design for Safe Destruction in Concurrent Containers. C++ standards committee paper, http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3712.pdf. (2013).Google Scholar
- Håkan Sundell and Philippas Tsigas. 2008. Lock-free deques and doubly linked lists. J. Parallel Distrib. Comput. 68, 7 (2008), 1008--1020. Google Scholar
Digital Library
Index Terms
Stamp-it, amortized constant-time memory reclamation in comparison to five other schemes
Recommendations
Stamp-it, amortized constant-time memory reclamation in comparison to five other schemes
PPoPP '18: Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel ProgrammingThe memory reclamation problem is to determine, for any given allocated memory node, when there are no more references to the node, allowing it to be safely returned to the memory management system. In a concurrent context, the memory reclamation ...
Automatic memory reclamation for lock-free data structures
OOPSLA '15Lock-free data-structures are widely employed in practice, yet designing lock-free memory reclamation for them is notoriously difficult. In particular, all known lock-free reclamation schemes are ``manual'' in the sense that the developer has to ...
Prudent Memory Reclamation in Procrastination-Based Synchronization
ASPLOS'16Procrastination is the fundamental technique used in synchronization mechanisms such as Read-Copy-Update (RCU) where writers, in order to synchronize with readers, defer the freeing of an object until there are no readers referring to the object. The ...







Comments