{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:44:37Z","timestamp":1775054677444,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T00:00:00Z","timestamp":1529280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,18]]},"DOI":"10.1145\/3210563.3210569","type":"proceedings-article","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T08:36:20Z","timestamp":1528706180000},"page":"14-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["FRC: a high-performance concurrent parallel deferred reference counter for C++"],"prefix":"10.1145","author":[{"given":"Charles","family":"Tripp","sequence":"first","affiliation":[{"name":"Terrain Data, USA"}]},{"given":"David","family":"Hyde","sequence":"additional","affiliation":[{"name":"Stanford University, USA \/ Terrain Data, USA"}]},{"given":"Benjamin","family":"Grossman-Ponemon","sequence":"additional","affiliation":[{"name":"Stanford University, USA \/ Terrain Data, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"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\/"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378819"},{"key":"e_1_3_2_1_3_1","first-page":"344","volume-title":"Proceedings of the 18th Annual ACM SIGPLAN Conference on Object-oriented Programing, Systems, Languages, and Applications (OOPSLA '03)","author":"Stephen","unstructured":"Stephen M. Blackburn and Kathryn S. McKinley. 2003. Ulterior Reference Counting: Fast Garbage Collection Without a Long Wait . In Proceedings of the 18th Annual ACM SIGPLAN Conference on Object-oriented Programing, Systems, Languages, and Applications (OOPSLA '03) . ACM, New York, NY, USA , 344 - 358 . Stephen M. Blackburn and Kathryn S. McKinley. 2003. Ulterior Reference Counting: Fast Garbage Collection Without a Long Wait. In Proceedings of the 18th Annual ACM SIGPLAN Conference on Object-oriented Programing, Systems, Languages, and Applications (OOPSLA '03). ACM, New York, NY, USA, 344-358."},{"key":"e_1_3_2_1_4_1","first-page":"22","volume-title":"ACM Conference on Programming Language Design and Implementation (PLDI '08)","author":"Stephen","unstructured":"Stephen M. Blackburn and Kathryn S. McKinley. 2008. Immix: A Mark-Region Garbage Collector with Space Efficiency, Fast Collection, and Mutator Performance . In ACM Conference on Programming Language Design and Implementation (PLDI '08) . ACM, 22 - 32 . Stephen M. Blackburn and Kathryn S. McKinley. 2008. Immix: A Mark-Region Garbage Collector with Space Efficiency, Fast Collection, and Mutator Performance. In ACM Conference on Programming Language Design and Implementation (PLDI '08). ACM, 22-32."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503282"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964019"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380180902"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/367487.367501"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029873.1029879"},{"key":"e_1_3_2_1_10_1","first-page":"9","article-title":"An Efficient, Incremental","volume":"19","author":"Peter Deutsch L.","year":"1976","unstructured":"L. Peter Deutsch and Daniel G. Bobrow . 1976 . An Efficient, Incremental , Automatic Garbage Collector. Commun. ACM 19 , 9 (Sept. 1976), 522-526. L. Peter Deutsch and Daniel G. Bobrow. 1976. An Efficient, Incremental, Automatic Garbage Collector. Commun. ACM 19, 9 (Sept. 1976), 522-526.","journal-title":"Automatic Garbage Collector. Commun. ACM"},{"key":"e_1_3_2_1_12_1","first-page":"58","volume-title":"Proceedings of the 2011 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness (MSPC '11)","author":"Jibaja Ivan","unstructured":"Ivan Jibaja , Stephen M. Blackburn , Mohammad R. Haghighat , and Kathryn S . McKinley. 2011. Deferred Gratification: Engineering for High Performance Garbage Collection from the Get Go . In Proceedings of the 2011 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness (MSPC '11) . ACM, New York, NY, USA , 58 - 65 . Ivan Jibaja, Stephen M. Blackburn, Mohammad R. Haghighat, and Kathryn S. McKinley. 2011. Deferred Gratification: Engineering for High Performance Garbage Collection from the Get Go. In Proceedings of the 2011 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness (MSPC '11). ACM, New York, NY, USA, 58-65."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516365"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/504282.504309"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/367177.367199"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542431.1542438"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2258996.2259008"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '14)","author":"Shahriyar Rifat","unstructured":"Rifat Shahriyar , Stephen M. Blackburn , and Kathryn S . McKinley. 2014. Fast Conservative Garbage Collection . In Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '14) . ACM, New York, NY, USA, 121- 139. Rifat Shahriyar, Stephen M. Blackburn, and Kathryn S. McKinley. 2014. Fast Conservative Garbage Collection. In Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '14). ACM, New York, NY, USA, 121- 139."},{"key":"e_1_3_2_1_20_1","first-page":"93","volume-title":"Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '13)","author":"Shahriyar Rifat","unstructured":"Rifat Shahriyar , Stephen Michael Blackburn , Xi Yang , and Kathryn S . McKinley. 2013. Taking off the Gloves with Reference Counting Immix . In Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '13) . ACM, New York, NY, USA , 93 - 110 . Rifat Shahriyar, Stephen Michael Blackburn, Xi Yang, and Kathryn S. McKinley. 2013. Taking off the Gloves with Reference Counting Immix. In Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '13). ACM, New York, NY, USA, 93-110."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645648.664824"}],"event":{"name":"ISMM '18: The International Symposium on Memory Management 2018","location":"Philadelphia PA USA","acronym":"ISMM '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210563.3210569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210563.3210569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:13:14Z","timestamp":1750198394000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210563.3210569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,18]]},"references-count":20,"alternative-id":["10.1145\/3210563.3210569","10.1145\/3210563"],"URL":"https:\/\/doi.org\/10.1145\/3210563.3210569","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3299706.3210569","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018,6,18]]},"assertion":[{"value":"2018-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}