{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:46:03Z","timestamp":1780994763939,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,2,10]],"date-time":"2018-02-10T00:00:00Z","timestamp":1518220800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"US National Science Foundation","award":["CNS-1319417, CCF-1337224, CCF-1422649, CCF-1717712"],"award-info":[{"award-number":["CNS-1319417, CCF-1337224, CCF-1422649, CCF-1717712"]}]},{"name":"Google, Inc.","award":["Faculty Research Award"],"award-info":[{"award-number":["Faculty Research Award"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,2,10]]},"DOI":"10.1145\/3178487.3178488","type":"proceedings-article","created":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T13:12:23Z","timestamp":1517922743000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Interval-based memory reclamation"],"prefix":"10.1145","author":[{"given":"Haosen","family":"Wen","sequence":"first","affiliation":[{"name":"University of Rochester"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph","family":"Izraelevitz","sequence":"additional","affiliation":[{"name":"University of Rochester"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wentao","family":"Cai","sequence":"additional","affiliation":[{"name":"University of Rochester"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H. Alan","family":"Beadle","sequence":"additional","affiliation":[{"name":"University of Rochester"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael L.","family":"Scott","sequence":"additional","affiliation":[{"name":"University of Rochester"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,2,10]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592808"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755600"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935790"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486184"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2150998"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755579"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2926697.2926699"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993821"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12142"},{"key":"e_1_3_2_2_11_1","volume-title":"Proc. of the 2006 BSDCan Conf.","author":"Evans Jason","year":"2006","unstructured":"Jason Evans . 2006 . A scalable concurrent malloc (3) implementation for FreeBSD . In Proc. of the 2006 BSDCan Conf. Jason Evans. 2006. A scalable concurrent malloc (3) implementation for FreeBSD. In Proc. of the 2006 BSDCan Conf."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.167"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/161468.161469"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062247.1062249"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.451"},{"key":"e_1_3_2_2_19_1","volume-title":"Read Copy Update. In 2002 Ottawa Linux Symp.","author":"McKenney Paul E.","year":"2002","unstructured":"Paul E. McKenney , Dipankar Sarma , Andrea Arcangeli , Andi Kleen , Orran Krieger , and Rusty Russell . 2002 . Read Copy Update. In 2002 Ottawa Linux Symp. Paul E. McKenney, Dipankar Sarma, Andrea Arcangeli, Andi Kleen, Orran Krieger, and Rusty Russell. 2002. Read Copy Update. In 2002 Ottawa Linux Symp."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_2_21_1","volume-title":"Scott","author":"Michael Maged M.","year":"1995","unstructured":"Maged M. Michael and Michael L . Scott . 1995 . Correction of a Memory Management Method for Lock-Free Data Structures. Technical Report TR 599. Dept. of Computer Science, Univ. of Rochester . Maged M. Michael and Michael L. Scott. 1995. Correction of a Memory Management Method for Lock-Free Data Structures. Technical Report TR 599. Dept. of Computer Science, Univ. of Rochester."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694374"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"},{"key":"e_1_3_2_2_24_1","volume-title":"Purely functional data structures","author":"Okasaki Chris","unstructured":"Chris Okasaki . 1999. Purely functional data structures . Cambridge University Press . Chris Okasaki. 1999. Purely functional data structures. Cambridge University Press."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087588"},{"key":"e_1_3_2_2_26_1","volume-title":"Systems Programming: Coping with Parallelism. Technical Report RJ 5118","author":"Treiber R. Kent","year":"1986","unstructured":"R. Kent Treiber . 1986 . Systems Programming: Coping with Parallelism. Technical Report RJ 5118 . IBM Almaden Research Center . R. Kent Treiber. 1986. Systems Programming: Coping with Parallelism. Technical Report RJ 5118. IBM Almaden Research Center."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224988"}],"event":{"name":"PPoPP '18: 23nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Vienna Austria","acronym":"PPoPP '18","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"]},"container-title":["Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178487.3178488","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3178487.3178488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:39:07Z","timestamp":1750196347000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178487.3178488"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,10]]},"references-count":26,"alternative-id":["10.1145\/3178487.3178488","10.1145\/3178487"],"URL":"https:\/\/doi.org\/10.1145\/3178487.3178488","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3200691.3178488","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018,2,10]]},"assertion":[{"value":"2018-02-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}