Concurrent Immediate Reference Counting

Memory management for optimistic concurrency in unmanaged programming languages is challenging. Safe memory reclamation (SMR) algorithms help address this, but they are difficult to use correctly. Automatic reference counting provides a simpler interface, but it has been less efficient than SMR algo...

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 8; no. PLDI; pp. 151 - 174
Main Authors:	Jung, Jaehwang, Kim, Jeonghyeon, Parkinson, Matthew J., Kang, Jeehoon
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 20.06.2024
Subjects:	Computing methodologies Concurrent algorithms Garbage collection Software and its engineering automatic memory reclamation reference counting concurrent data structures
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!