Concurrent Immediate Reference Counting (Abstract)
Pages 3 - 4
Abstract
We present Concurrent Immediate Reference Counting (CIRC), a new automatic concurrent reference counting method for unmanaged languages. CIRC utilizes deferral for high-performance local references, and yet it can immediately reclaim big linked structures.
References
[1]
Daniel Anderson, Guy E. Blelloch, and Yuanhao Wei. 2021. Concurrent Deferred Reference Counting with Constant-Time Overhead. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). 526--541. https://doi.org/10.1145/3453483.3454060
[2]
Daniel Anderson, Guy E. Blelloch, and Yuanhao Wei. 2022. Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). 61--75. https://doi.org/10.1145/3519939.3523730
[3]
David F. Bacon, Clement R. Attanasio, Han B. Lee, V. T. Rajan, and Stephen Smith. 2001. Java without the Coffee Breaks: A Nonintrusive Multiprocessor Garbage Collector. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). 92--103. https://doi.org/10.1145/378795.378819
[4]
Andreia Correia, Pedro Ramalhete, and Pascal Felber. 2021. OrcGC: Automatic Lock-Free Memory Reclamation. In Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP). 205--218. https://doi.org/10.1145/3437801.3441596
[5]
L. Peter Deutsch and Daniel G. Bobrow. 1976. An Efficient, Incremental, Automatic Garbage Collector. Commun. ACM, Vol. 19, 9 (sep 1976), 522--526. https://doi.org/10.1145/360336.360345
[6]
Keir Fraser. 2004. Practical lock-freedom. Ph.,D. Dissertation. University of Cambridge, Computer Laboratory.
[7]
Jaehwang Jung, Jeonghyeon Kim, Matthew J. Parkinson, and Jeehoon Kang. 2024. Concurrent Immediate Reference Counting. Proc. ACM Program. Lang., Vol. 8, PLDI, Article 153 (jun 2024), 24 pages. https://doi.org/10.1145/3656383
[8]
Maged M. Michael. 2004. Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. IEEE Trans. Parallel Distrib. Syst., Vol. 15, 6 (June 2004), 491--504. https://doi.org/10.1109/TPDS.2004.8
[9]
Pedro Ramalhete and Andreia Correia. 2017. DoubleLink - A Low-Overhead Lock-Free Queue. https://concurrencyfreaks.blogspot.com/2017/01/doublelink-low-overhead-lock-free-queue.html
[10]
Charles Tripp, David Hyde, and Benjamin Grossman-Ponemon. 2018. FRC: A High-Performance Concurrent Parallel Deferred Reference Counter for C. In Proceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management (ISMM). 14--28. https://doi.org/10.1145/3210563.3210569
Index Terms
- Concurrent Immediate Reference Counting (Abstract)
Recommendations
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,...
Ulterior reference counting: fast garbage collection without a long wait
OOPSLA '03: Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applicationsGeneral purpose garbage collectors have yet to combine short pause times with high throughput. For example, generational collectors can achieve high throughput. They have modest average pause times, but occasionally collect the whole heap and ...
Ulterior reference counting: fast garbage collection without a long wait
Special Issue: Proceedings of the OOPSLA '03 conferenceGeneral purpose garbage collectors have yet to combine short pause times with high throughput. For example, generational collectors can achieve high throughput. They have modest average pause times, but occasionally collect the whole heap and ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2024 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIGARCH: ACM Special Interest Group on Computer Architecture
- EATCS: European Association for Theoretical Computer Science
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 26 July 2024
Check for updates
Author Tags
Qualifiers
- Poster
Conference
SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures
June 17, 2024
Nantes, France
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 19Total Downloads
- Downloads (Last 12 months)19
- Downloads (Last 6 weeks)0
Reflects downloads up to 27 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in