Affiliation:
1. Terrain Data, USA
2. Stanford University, USA / Terrain Data, USA
Abstract
We present FRC, a high-performance concurrent parallel reference counter for unmanaged languages. It is well known that high-performance garbage collectors help developers write memory-safe, highly concurrent systems and data structures. While C++, C, and other unmanaged languages are used in high-performance applications, adding concurrent memory management to these languages has proven to be difficult. Unmanaged languages like C++ use pointers instead of references, and have uncooperative mutators which do not pause easily at a safe point. Thus, scanning mutator stack root references is challenging.
FRC only defers decrements and does not require mutator threads to pause during collection. By deferring only decrements, FRC avoids much of the synchronization overhead of a fully-deferred implementation. Root references are scanned without interrupting the mutator by publishing these references to a thread-local array. FRC's performance can exceed that of the C++ standard library's shared pointer by orders of magnitude. FRC's thread-safety guarantees and low synchronization overhead enable significant throughput gains for concurrently-readable shared data structures.
We describe the components of FRC, including our static tree router data structure: a novel barrier which improves the scalability of parallel collection workers. FRC's performance is evaluated on several concurrent data structures. We release FRC and our tests as open-source code and expect FRC will be useful for many concurrent C++ software systems.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference21 articles.
1. Nikolas Askitis. 2012. Cache-conscious String Data Structures Sorting and Algorithms: theory and practice. http://web.archive.org/web/20120206015921/http://www.naskitis.com/ Nikolas Askitis. 2012. Cache-conscious String Data Structures Sorting and Algorithms: theory and practice. http://web.archive.org/web/20120206015921/http://www.naskitis.com/
2. Java without the coffee breaks
3. Bounding space usage of conservative garbage collectors
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Communication Combination Technology and Routing Protocol Algorithm Design Based on Artificial Neural Networks;2023 International Conference on Power, Electrical Engineering, Electronics and Control (PEEEC);2023-09-25
2. Using Dynamic Memory Reallocation in GInv;Programming and Computer Software;2023-07-28
3. Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract);Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing;2023-07-18
4. Research on Switching Structure of High-Performance Higher-Order Router Based on Grey Clustering Algorithm;2023 International Conference on Networking, Informatics and Computing (ICNETIC);2023-05
5. Turning manual concurrent memory reclamation into automatic reference counting;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09