{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T21:27:40Z","timestamp":1775338060867,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T00:00:00Z","timestamp":1708387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["CRDPJ 539431-19"],"award-info":[{"award-number":["CRDPJ 539431-19"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2019-04227"],"award-info":[{"award-number":["RGPIN-2019-04227"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["DGECR-2019-00048"],"award-info":[{"award-number":["DGECR-2019-00048"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100000196","name":"Canada Foundation for Innovation","doi-asserted-by":"publisher","award":["JELF 38512"],"award-info":[{"award-number":["JELF 38512"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100000196","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100004490","name":"University of Waterloo","doi-asserted-by":"publisher","id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100004490","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,3,2]]},"DOI":"10.1145\/3627535.3638491","type":"proceedings-article","created":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T14:22:41Z","timestamp":1708438961000},"page":"30-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Are Your Epochs Too Epic? Batch Free Can Be Harmful"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1782-4913","authenticated-orcid":false,"given":"Daewoo","family":"Kim","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0074-1031","authenticated-orcid":false,"given":"Trevor","family":"Brown","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6534-8137","authenticated-orcid":false,"given":"Ajay","family":"Singh","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}]}],"member":"320","published-online":{"date-parts":[[2024,2,20]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2021. Crystalline: Fast and Memory Efficient Wait-Free Reclamation Ruslan Nikolaev and Binoy Ravindran (Eds.). CoRR abs\/2108.02763. arXiv:2108.02763 https:\/\/arxiv.org\/abs\/2108.02763"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592808"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064214"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3201897"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454060"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523730"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837853.1693488"},{"key":"e_1_3_2_2_8_1","volume-title":"Techniques for Constructing Efficient Lock-free Data Structures. Ph. D. Dissertation","author":"Brown Trevor","unstructured":"Trevor Brown. 2017. Techniques for Constructing Efficient Lock-free Data Structures. Ph. D. Dissertation. University of Toronto."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858965.2814298"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755579"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441596"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384016"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2926697.2926699"},{"key":"e_1_3_2_2_15_1","volume-title":"Proc. of the bsdcan conference, ottawa, canada.","author":"Evans Jason","year":"2006","unstructured":"Jason Evans. 2006. A scalable concurrent malloc (3) implementation for FreeBSD. In Proc. of the bsdcan conference, ottawa, canada."},{"key":"e_1_3_2_2_17_1","volume-title":"TCMalloc: Thread-caching malloc.","author":"Ghemawat Sanjay","year":"2023","unstructured":"Sanjay Ghemawat and Paul Menage. 2005. TCMalloc: Thread-caching malloc. Retrieved from http:\/\/goog-perftools.sourceforge.net\/doc\/tcmalloc.html on January 27, 2023 (2005)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.167"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062247.1062249"},{"key":"e_1_3_2_2_22_1","volume-title":"J Eliot B Moss, and David S Munro","author":"Hudson Richard L","year":"1997","unstructured":"Richard L Hudson, Ron Morrison, J Eliot B Moss, and David S Munro. 1997. Training distributed garbage: The DMOS collector. Object-Oriented Programming Systems, Language and Applications (1997)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591102"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385978"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1218063.1217949"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34175-6_13"},{"key":"e_1_3_2_2_27_1","volume-title":"Parallel and Distributed Computing and Systems","volume":"509518","author":"McKenney Paul E","year":"1998","unstructured":"Paul E McKenney and John D Slingwine. 1998. Read-copy update: Using execution history to solve concurrency problems. In Parallel and Distributed Computing and Systems, Vol. 509518. Citeseer, 509--518."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-27618-8_1"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591089"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331575"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374540"},{"key":"e_1_3_2_2_33_1","volume-title":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. 367--369","author":"Ramalhete Pedro","unstructured":"Pedro Ramalhete and Andreia Correia. [n. d.]. Brief announcement: Hazard eras-non-blocking memory reclamation. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. 367--369."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461817"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441625"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS54959.2023.00021"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2023.3335671"},{"key":"e_1_3_2_2_38_1","volume-title":"QDo: A Quiescent State Callback Facility. Ph. D. Dissertation","author":"Tam Adrian","unstructured":"Adrian Tam. 2006. QDo: A Quiescent State Callback Facility. Ph. D. Dissertation. University of Toronto."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3200691.3178488"},{"key":"e_1_3_2_2_40_1","volume-title":"Why is memory reclamation so important for lock-free algorithms?","year":"2023","unstructured":"ycombinator. 2017. Why is memory reclamation so important for lock-free algorithms? Retrieved from https:\/\/web.archive.org\/web\/20200223075152\/https:\/\/news.ycombinator.com\/item?id=15269628 on January 27, 2023."}],"event":{"name":"PPoPP '24: 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","location":"Edinburgh United Kingdom","acronym":"PPoPP '24","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627535.3638491","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627535.3638491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:04Z","timestamp":1750287004000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627535.3638491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,20]]},"references-count":39,"alternative-id":["10.1145\/3627535.3638491","10.1145\/3627535"],"URL":"https:\/\/doi.org\/10.1145\/3627535.3638491","relation":{},"subject":[],"published":{"date-parts":[[2024,2,20]]},"assertion":[{"value":"2024-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}