{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:11:35Z","timestamp":1755997895966,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519939.3523730","type":"proceedings-article","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T21:05:05Z","timestamp":1654203905000},"page":"61-75","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Turning manual concurrent memory reclamation into automatic reference counting"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Anderson","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}]},{"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}]},{"given":"Yuanhao","family":"Wei","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454060"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178519"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441596"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786763.2694359"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/777474.777479"},{"key":"e_1_3_2_1_7_1","unstructured":"J. Evans. 2019 (accessed November 5 2019). Scalable memory allocation using jemalloc. \u00a7MALL https:\/\/www.facebook.com\/notes\/facebook-engineering\/scalable-memory-allocation-using-jemalloc\/480222803919  J. Evans. 2019 (accessed November 5 2019). Scalable memory allocation using jemalloc. \u00a7MALL https:\/\/www.facebook.com\/notes\/facebook-engineering\/scalable-memory-allocation-using-jemalloc\/480222803919"},{"volume-title":"Practical lock-freedom","author":"Fraser Keir","key":"e_1_3_2_1_8_1","unstructured":"Keir Fraser . 2004. Practical lock-freedom . University of Cambridge , Computer Laboratory . Keir Fraser. 2004. Practical lock-freedom. University of Cambridge, Computer Laboratory."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386031"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.472.0221"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45414-4_21"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062247.1062249"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36108-1_23"},{"volume-title":"The Art of Multiprocessor Programming","author":"Herlihy Maurice","key":"e_1_3_2_1_15_1","unstructured":"Maurice Herlihy and Nir Shavit . 2008. The Art of Multiprocessor Programming . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA. isbn:0123705916, 9780123705914 Maurice Herlihy and Nir Shavit. 2008. The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. isbn:0123705916, 9780123705914"},{"key":"e_1_3_2_1_16_1","volume-title":"The Garbage Collection Handbook: The Art of Automatic Memory Management","author":"Jones Richard","year":"2008","unstructured":"Richard Jones , Antony Hosking , and Eliot Moss . 2011. The Garbage Collection Handbook: The Art of Automatic Memory Management ( 1 st ed.). Chapman & Hall\/CRC. isbn:14 2008 2795 Richard Jones, Antony Hosking, and Eliot Moss. 2011. The Garbage Collection Handbook: The Art of Automatic Memory Management (1st ed.). Chapman & Hall\/CRC. isbn:1420082795","edition":"1"},{"key":"e_1_3_2_1_17_1","unstructured":"The GNU C++ Library. 2019 (accessed November 5 2019). The GNU C++ Library. \u00a7MALL https:\/\/gcc.gnu.org\/onlinedocs\/libstdc++\/  The GNU C++ Library. 2019 (accessed November 5 2019). The GNU C++ Library. \u00a7MALL https:\/\/gcc.gnu.org\/onlinedocs\/libstdc++\/"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564881"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_20_1","unstructured":"Microsoft. 2021 (accessed November 17 2021). Microsoft\u2019s C++ Standard Library. \u00a7MALL https:\/\/github.com\/microsoft\/STL  Microsoft. 2021 (accessed November 17 2021). Microsoft\u2019s C++ Standard Library. \u00a7MALL https:\/\/github.com\/microsoft\/STL"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331575"},{"key":"e_1_3_2_1_23_1","volume-title":"Universal Wait-Free Memory Reclamation. In ACM Symposium on Principles and Practice of Parallel Programming (PPoPP). 130\u2013143","author":"Nikolaev Ruslan","year":"2020","unstructured":"Ruslan Nikolaev and Binoy Ravindran . 2020 . Universal Wait-Free Memory Reclamation. In ACM Symposium on Principles and Practice of Parallel Programming (PPoPP). 130\u2013143 . isbn:9781450368186 Ruslan Nikolaev and Binoy Ravindran. 2020. Universal Wait-Free Memory Reclamation. In ACM Symposium on Principles and Practice of Parallel Programming (PPoPP). 130\u2013143. isbn:9781450368186"},{"key":"e_1_3_2_1_24_1","volume-title":"Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation. In International Symposium on Distributed Computing (DISC).","author":"Nikolaev Ruslan","year":"2021","unstructured":"Ruslan Nikolaev and Binoy Ravindran . 2021 . Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation. In International Symposium on Distributed Computing (DISC). Ruslan Nikolaev and Binoy Ravindran. 2021. Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation. In International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454090"},{"key":"e_1_3_2_1_26_1","unstructured":"Pedro Ramalhete and Andreia Correia. [n. d.]. DoubleLink - A Low-Overhead Lock-Free Queue. \u00a7MALL http:\/\/concurrencyfreaks.blogspot.com\/2017\/01\/doublelink-low-overhead-lock-free-queue.html  Pedro Ramalhete and Andreia Correia. [n. d.]. DoubleLink - A Low-Overhead Lock-Free Queue. \u00a7MALL http:\/\/concurrencyfreaks.blogspot.com\/2017\/01\/doublelink-low-overhead-lock-free-queue.html"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087588"},{"key":"e_1_3_2_1_28_1","volume-title":"Wait-Free Reference Counting and Memory Management. In International Parallel and Distributed Processing Symposium (IPDPS).","author":"Sundell H\u00e5kan","year":"2005","unstructured":"H\u00e5kan Sundell . 2005 . Wait-Free Reference Counting and Memory Management. In International Parallel and Distributed Processing Symposium (IPDPS). H\u00e5kan Sundell. 2005. Wait-Free Reference Counting and Memory Management. In International Parallel and Distributed Processing Symposium (IPDPS)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299706.3210569"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3200691.3178488"},{"key":"e_1_3_2_1_31_1","unstructured":"Anthony Williams. 2012. C++ concurrency in action: practical multithreading. Manning Publ..  Anthony Williams. 2012. C++ concurrency in action: practical multithreading. Manning Publ.."},{"key":"e_1_3_2_1_32_1","unstructured":"Anthony Williams. 2019 (accessed November 5 2019). just::thread Concurrency Library. \u00a7MALL https:\/\/www.stdthread.co.uk  Anthony Williams. 2019 (accessed November 5 2019). just::thread Concurrency Library. \u00a7MALL https:\/\/www.stdthread.co.uk"}],"event":{"name":"PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"San Diego CA USA","acronym":"PLDI '22"},"container-title":["Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519939.3523730","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519939.3523730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:31Z","timestamp":1750183831000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519939.3523730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":32,"alternative-id":["10.1145\/3519939.3523730","10.1145\/3519939"],"URL":"https:\/\/doi.org\/10.1145\/3519939.3523730","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}