{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:07:43Z","timestamp":1755907663853,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T00:00:00Z","timestamp":1740700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSERC Discovery Program Grant:","award":["2019-04227"],"award-info":[{"award-number":["2019-04227"]}]},{"DOI":"10.13039\/501100006374","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["539431-19"],"award-info":[{"award-number":["539431-19"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Canada Foundation for Innovation John R. Evans Leaders Fund","award":["38512"],"award-info":[{"award-number":["38512"]}]},{"name":"NSERC Discovery Launch Grant:","award":["2019-00048"],"award-info":[{"award-number":["2019-00048"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,2,28]]},"DOI":"10.1145\/3710848.3710890","type":"proceedings-article","created":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T06:20:57Z","timestamp":1740723657000},"page":"128-141","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Publish on Ping: A Better Way to Publish Reservations in Memory Reclamation for Concurrent Data Structures"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6534-8137","authenticated-orcid":false,"given":"Ajay","family":"Singh","sequence":"first","affiliation":[{"name":"University of Waterloo, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0074-1031","authenticated-orcid":false,"given":"Trevor","family":"Brown","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}]}],"member":"320","published-online":{"date-parts":[[2025,2,28]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2024. CVE-2024-26602. Available from MITRE CVE-ID CVE-2024-26602.. https:\/\/cve.mitre.org\/cgi-bin\/cvename.cgi?name=CVE-2024-26602"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592808"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064214"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3201897"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454060"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454060"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523730"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935790"},{"key":"e_1_3_2_1_9_1","volume-title":"Concurrent Reference Counting and Resource Management in Wait-free Constant Time. arXiv preprint arXiv:2002.07053","author":"Blelloch Guy E","year":"2020","unstructured":"Guy E Blelloch and Yuanhao Wei. 2020. Concurrent Reference Counting and Resource Management in Wait-free Constant Time. arXiv preprint arXiv:2002.07053 (2020)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486184"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837853.1693488"},{"key":"e_1_3_2_1_12_1","volume-title":"Techniques for Constructing Efficient Lock-free Data Structures. arXiv preprint arXiv:1712.05406","author":"Brown Trevor","year":"2017","unstructured":"Trevor Brown. 2017. Techniques for Constructing Efficient Lock-free Data Structures. arXiv preprint arXiv:1712.05406 (2017)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_1_14_1","volume-title":"Memory Management: From Theory to Practice. Ph. D. Dissertation. Technion - Israel Institute of Technology, Israel. https:\/\/www.cs.technion.ac.il\/users\/wwwb\/cgi-bin\/tr-info.cgi\/2016\/PHD\/PHD-2016-11","author":"Cohen Nachshon","year":"2016","unstructured":"Nachshon Cohen. 2016. Memory Management: From Theory to Practice. Ph. D. Dissertation. Technion - Israel Institute of Technology, Israel. https:\/\/www.cs.technion.ac.il\/users\/wwwb\/cgi-bin\/tr-info.cgi\/2016\/PHD\/PHD-2016-11"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276513"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858965.2814298"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755579"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 205--218","author":"Correia Andreia","year":"2021","unstructured":"Andreia Correia, Pedro Ramalhete, and Pascal Felber. 2021. Orcgc: automatic lockfree memory reclamation. In Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 205--218."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786763.2694359"},{"key":"e_1_3_2_1_20_1","unstructured":"Mathieu Desnoyers. 12 March 2015. Alternative to signals\/sys_membarrier() in liburcu. Retrieved online. https:\/\/lists.lttng.org\/pipermail\/lttng-dev\/2015-March\/024270.html [Accessed 15-08-2024]."},{"key":"e_1_3_2_1_21_1","unstructured":"Mathieu Desnoyers. April 2015. sys_membarrier(): system-wide memory barrier (x86) [LWN.net] --- lwn.net. https:\/\/lwn.net\/Articles\/640239\/. [Accessed 15-08-2024]."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384016"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2926697.2926699"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993821"},{"key":"e_1_3_2_1_25_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_1_26_1","unstructured":"Keir Fraser. 2004. Practical lock-freedom. Technical Report. University of Cambridge Computer Laboratory."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.167"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_3_2_1_30_1","volume-title":"International Conference On Principles Of Distributed Systems. Springer, 3--16","author":"Heller Steve","year":"2005","unstructured":"Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N Scherer, and Nir Shavit. 2005. A lazy concurrent list-based set algorithm. In International Conference On Principles Of Distributed Systems. Springer, 3--16."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062247.1062249"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36108-1_23"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591102"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385978"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Daewoo Kim Trevor Brown and Ajay Singh. 2024. Are Your Epochs Too Epic? Batch Free Can Be Harmful. arXiv:2401.11347 [cs.DC]","DOI":"10.1145\/3627535.3638491"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626183.3659941"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34175-6_13"},{"key":"e_1_3_2_1_38_1","volume-title":"Memory barriers: a hardware view for software hackers","author":"McKenney Paul E","year":"2010","unstructured":"Paul E McKenney. 2010. Memory barriers: a hardware view for software hackers. Linux Technology Center, IBM Beaverton (2010)."},{"key":"e_1_3_2_1_39_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."},{"key":"e_1_3_2_1_40_1","unstructured":"Sohil Mehta. September 2021. User Interrupts - A faster way to signal. Retrieved online. https:\/\/lpc.events\/event\/11\/contributions\/985\/attachments\/756\/1417\/User_Interrupts_LPC_2021.pdf [Accessed 15-08-2024]."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_42_1","volume-title":"Hazard Pointers: Safe Resource Reclamation for Optimistic Concurrency. Technical Report. Technical Report P0233R3. C++ SG14 Working Group.","author":"Michael Maged M","year":"2017","unstructured":"Maged M Michael, Michael Wong, Paul McKenney, Arthur O'Dwyer, and David Hollman. 2017. Hazard Pointers: Safe Resource Reclamation for Optimistic Concurrency. Technical Report. Technical Report P0233R3. C++ SG14 Working Group."},{"key":"e_1_3_2_1_43_1","unstructured":"Maged M Michael Michael Wong Paul McKenney Geoffrey Romer Andrew Hunter Arthur O'Dwyer David S Hollman JF Bastien Hans Boehm David Goldblatt et al. 2017. Proposed Wording for Concurrent Data Structures: Hazard Pointer and Read-Copy-Update (RCU)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591089"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786763.2694374"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331575"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374540"},{"key":"e_1_3_2_1_48_1","unstructured":"Ruslan Nikolaev and Binoy Ravindran. 2021. Brief announcement: Crystalline: Fast and memory efficient wait-free reclamation. (2021)."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658851"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087588"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461817"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577491"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Ajay Singh and Trevor Brown. 2025. Publish on Ping: A Better Way to Publish Reservations in Memory Reclamation for Concurrent Data Structures. arXiv:2501.04250 [cs.DC] https:\/\/arxiv.org\/abs\/2501.04250","DOI":"10.1145\/3710848.3710890"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441625"},{"key":"e_1_3_2_1_55_1","volume-title":"Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures. arXiv preprint arXiv:2302.12958","author":"Singh Ajay","year":"2023","unstructured":"Ajay Singh, Trevor Brown, and Michael Spear. 2023. Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures. arXiv preprint arXiv:2302.12958 (2023)."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS54959.2023.00021"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2023.3335671"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.451"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224988"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3200691.3178488"}],"event":{"name":"PPoPP '25: The 30th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Las Vegas NV USA","acronym":"PPoPP '25"},"container-title":["Proceedings of the 30th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3710848.3710890","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3710848.3710890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T15:12:55Z","timestamp":1755875575000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3710848.3710890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,28]]},"references-count":60,"alternative-id":["10.1145\/3710848.3710890","10.1145\/3710848"],"URL":"https:\/\/doi.org\/10.1145\/3710848.3710890","relation":{},"subject":[],"published":{"date-parts":[[2025,2,28]]},"assertion":[{"value":"2025-02-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}