FRC: a high-performance concurrent parallel deferred reference counter for C++

Author:

Tripp Charles1,Hyde David2,Grossman-Ponemon Benjamin2

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3