{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:21Z","timestamp":1750220361999,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2005\/17"],"award-info":[{"award-number":["2005\/17"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,2,17]]},"DOI":"10.1145\/3437801.3441582","type":"proceedings-article","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T23:04:20Z","timestamp":1613862260000},"page":"191-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficiently reclaiming memory in concurrent search data structures while bounding wasted memory"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Solomon","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}]},{"given":"Adam","family":"Morrison","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}]}],"member":"320","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755600"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064214"},{"key":"e_1_3_2_1_3_1","volume-title":"Fast and Robust Memory Reclamation for Concurrent Data Structures. In SPAA '16","author":"Balmau Oana","year":"2016","unstructured":"Oana Balmau , Rachid Guerraoui , Maurice Herlihy , and Igor Zablotchi . 2016 . Fast and Robust Memory Reclamation for Concurrent Data Structures. In SPAA '16 . Oana Balmau, Rachid Guerraoui, Maurice Herlihy, and Igor Zablotchi. 2016. Fast and Robust Memory Reclamation for Concurrent Data Structures. In SPAA '16."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486184"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555267"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276513"},{"key":"e_1_3_2_1_8_1","volume-title":"Automatic Memory Reclamation for Lock-free Data Structures (OOPSLA","author":"Cohen Nachshon","year":"2015","unstructured":"Nachshon Cohen and Erez Petrank . 2015. Automatic Memory Reclamation for Lock-free Data Structures (OOPSLA 2015 ). Nachshon Cohen and Erez Petrank. 2015. Automatic Memory Reclamation for Lock-free Data Structures (OOPSLA 2015)."},{"key":"e_1_3_2_1_9_1","volume-title":"Efficient Memory Management for Lock-Free Data Structures with Optimistic Access. In SPAA '15","author":"Cohen Nachshon","year":"2015","unstructured":"Nachshon Cohen and Erez Petrank . 2015 . Efficient Memory Management for Lock-Free Data Structures with Optimistic Access. In SPAA '15 . Nachshon Cohen and Erez Petrank. 2015. Efficient Memory Management for Lock-Free Data Structures with Optimistic Access. In SPAA '15."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694359"},{"key":"e_1_3_2_1_11_1","volume-title":"Jr.","author":"Detlefs David L.","year":"2002","unstructured":"David L. Detlefs , Paul A. Martin , Mark Moir , and Guy L . Steele , Jr. 2002 . Lock-free Reference Counting. Distributed Computing 15, 4 (2002). David L. Detlefs, Paul A. Martin, Mark Moir, and Guy L. Steele, Jr. 2002. Lock-free Reference Counting. Distributed Computing 15, 4 (2002)."},{"key":"e_1_3_2_1_12_1","volume-title":"Fast Non-Intrusive Memory Reclamation for Highly-Concurrent Data Structures. In ISMM '16","author":"Dice Dave","year":"2016","unstructured":"Dave Dice , Maurice Herlihy , and Alex Kogan . 2016 . Fast Non-Intrusive Memory Reclamation for Highly-Concurrent Data Structures. In ISMM '16 . Dave Dice, Maurice Herlihy, and Alex Kogan. 2016. Fast Non-Intrusive Memory Reclamation for Highly-Concurrent Data Structures. In ISMM '16."},{"key":"e_1_3_2_1_13_1","volume-title":"Non-Blocking Binary Search Trees. In PODC '10","author":"Ellen Faith","year":"2010","unstructured":"Faith Ellen , Panagiota Fatourou , Eric Ruppert , and Franck van Breugel . 2010 . Non-Blocking Binary Search Trees. In PODC '10 . Faith Ellen, Panagiota Fatourou, Eric Ruppert, and Franck van Breugel. 2010. Non-Blocking Binary Search Trees. In PODC '10."},{"key":"e_1_3_2_1_14_1","unstructured":"Jason Evans. 2006. A Scalable Concurrent malloc(3) Implementation for FreeBSD.  Jason Evans. 2006. A Scalable Concurrent malloc(3) Implementation for FreeBSD."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"key":"e_1_3_2_1_17_1","volume-title":"Wait-free synchronization. TOPLAS 13 (January","author":"Herlihy Maurice","year":"1991","unstructured":"Maurice Herlihy . 1991. Wait-free synchronization. TOPLAS 13 (January 1991 ), 26 pages. Issue 1. Maurice Herlihy. 1991. Wait-free synchronization. TOPLAS 13 (January 1991), 26 pages. Issue 1."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1698156"},{"volume-title":"SPAA '12","author":"Shane","key":"e_1_3_2_1_19_1","unstructured":"Shane V. Howley and Jeremy Jones. 2012. A Non-Blocking Internal Binary Search Tree . In SPAA '12 . Shane V. Howley and Jeremy Jones. 2012. A Non-Blocking Internal Binary Search Tree. In SPAA '12."},{"volume-title":"PDCS '98","author":"Paul","key":"e_1_3_2_1_20_1","unstructured":"Paul E. McKenney and John D. Slingwine. 1998. Read-copy update: Using execution history to solve concurrency problems . In PDCS '98 . Paul E. McKenney and John D. Slingwine. 1998. Read-copy update: Using execution history to solve concurrency problems. In PDCS '98."},{"key":"e_1_3_2_1_21_1","volume-title":"High Performance Dynamic Lock-Free Hash Tables and List-Based Sets. In SPAA '02","author":"Michael Maged M.","year":"2002","unstructured":"Maged M. Michael . 2002 . High Performance Dynamic Lock-Free Hash Tables and List-Based Sets. In SPAA '02 . Maged M. Michael. 2002. High Performance Dynamic Lock-Free Hash Tables and List-Based Sets. In SPAA '02."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_23_1","volume-title":"Hazard Pointers: Safe Resource Reclamation for Optimistic Concurrency. 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 P0233R3. C++ SG14 Working Group. Maged M. Michael, Michael Wong, Paul McKenney, Arthur O'Dwyer, and David Hollman. 2017. Hazard Pointers: Safe Resource Reclamation for Optimistic Concurrency. Technical Report P0233R3. C++ SG14 Working Group."},{"key":"e_1_3_2_1_24_1","volume-title":"Fast Concurrent Lock-free Binary Search Trees. In PPoPP '14","author":"Natarajan Aravind","year":"2014","unstructured":"Aravind Natarajan and Neeraj Mittal . 2014 . Fast Concurrent Lock-free Binary Search Trees. In PPoPP '14 . Aravind Natarajan and Neeraj Mittal. 2014. Fast Concurrent Lock-free Binary Search Trees. In PPoPP '14."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3141879"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684464.2684472"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087588"},{"volume-title":"Efficiently Reclaiming Memory in Concurrent Search Data Structures While Bounding Wasted Memory. Master's thesis","author":"Solomon Daniel","key":"e_1_3_2_1_28_1","unstructured":"Daniel Solomon . 2020. Efficiently Reclaiming Memory in Concurrent Search Data Structures While Bounding Wasted Memory. Master's thesis . Tel Aviv University . Daniel Solomon. 2020. Efficiently Reclaiming Memory in Concurrent Search Data Structures While Bounding Wasted Memory. Master's thesis. Tel Aviv University."},{"volume-title":"Interval-based Memory Reclamation. In PPoPP '18","author":"Wen Haosen","key":"e_1_3_2_1_29_1","unstructured":"Haosen Wen , Joseph Izraelevitz , Wentao Cai , H. Alan Beadle , and Michael L. Scott . 2018 . Interval-based Memory Reclamation. In PPoPP '18 . Haosen Wen, Joseph Izraelevitz, Wentao Cai, H. Alan Beadle, and Michael L. Scott. 2018. Interval-based Memory Reclamation. In PPoPP '18."}],"event":{"name":"PPoPP '21: 26th ACM SIGPLAN 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":"Virtual Event Republic of Korea","acronym":"PPoPP '21"},"container-title":["Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441582","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437801.3441582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:25Z","timestamp":1750191445000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,17]]},"references-count":28,"alternative-id":["10.1145\/3437801.3441582","10.1145\/3437801"],"URL":"https:\/\/doi.org\/10.1145\/3437801.3441582","relation":{},"subject":[],"published":{"date-parts":[[2021,2,17]]},"assertion":[{"value":"2021-02-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}