{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:37:57Z","timestamp":1752982677315,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T00:00:00Z","timestamp":1623974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2022, N00014-19-1-2493"],"award-info":[{"award-number":["N00014-18-1-2022, N00014-19-1-2493"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-15-1-0098, FA9550-16-1-0371"],"award-info":[{"award-number":["FA9550-15-1-0098, FA9550-16-1-0371"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,19]]},"DOI":"10.1145\/3453483.3454090","type":"proceedings-article","created":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T16:58:49Z","timestamp":1624553929000},"page":"987-1002","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Snapshot-free, transparent, and robust memory reclamation for lock-free data structures"],"prefix":"10.1145","author":[{"given":"Ruslan","family":"Nikolaev","sequence":"first","affiliation":[{"name":"Virginia Tech, USA"}]},{"given":"Binoy","family":"Ravindran","sequence":"additional","affiliation":[{"name":"Virginia Tech, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2020. Allocator Benchmarks. https:\/\/locklessinc.com  2020. Allocator Benchmarks. https:\/\/locklessinc.com"},{"key":"e_1_3_2_1_2_1","unstructured":"2020. ARM Architecture Reference Manual ARMv8. https:\/\/developer.arm.com\/  2020. ARM Architecture Reference Manual ARMv8. https:\/\/developer.arm.com\/"},{"key":"e_1_3_2_1_3_1","unstructured":"2020. Concurrency Kit. http:\/\/concurrencykit.org\/  2020. Concurrency Kit. http:\/\/concurrencykit.org\/"},{"key":"e_1_3_2_1_4_1","unstructured":"2020. Intel 64 and IA-32 Developer\u2019s Manual. https:\/\/www.intel.com\/  2020. Intel 64 and IA-32 Developer\u2019s Manual. https:\/\/www.intel.com\/"},{"key":"e_1_3_2_1_5_1","unstructured":"2020. Linux Programmer\u2019s Manual \u2013 membarrier(2) \u2013 Linux manual page. https:\/\/man7.org\/linux\/man-pages\/man2\/membarrier.2.html  2020. Linux Programmer\u2019s Manual \u2013 membarrier(2) \u2013 Linux manual page. https:\/\/man7.org\/linux\/man-pages\/man2\/membarrier.2.html"},{"volume-title":"Oracle SPARC Architecture","year":"2011","key":"e_1_3_2_1_6_1","unstructured":"2020. Oracle SPARC Architecture 2011 . http:\/\/www.oracle.com\/ 2020. Oracle SPARC Architecture 2011. http:\/\/www.oracle.com\/"},{"key":"e_1_3_2_1_7_1","unstructured":"2020. Software Optimization Guide for AMD Family 10h and 12h Processors. https:\/\/www.amd.com\/system\/files\/TechDocs\/40546.pdf  2020. Software Optimization Guide for AMD Family 10h and 12h Processors. https:\/\/www.amd.com\/system\/files\/TechDocs\/40546.pdf"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592808"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064214"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3201897"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935790"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486184"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/2189750.2150998"},{"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\/2814270.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","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441596"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2926697.2926699"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993821"},{"key":"e_1_3_2_1_21_1","volume-title":"Proc. of the BSDCan Conference","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. https:\/\/www.bsdcan.org\/ 2006\/papers\/jemalloc.pdf Jason Evans. 2006. A scalable concurrent malloc (3) implementation for FreeBSD. In Proc. of the BSDCan Conference, Ottawa, Canada. https:\/\/www.bsdcan.org\/2006\/papers\/jemalloc.pdf"},{"volume-title":"Practical lock-freedom","author":"Fraser Keir","key":"e_1_3_2_1_22_1","unstructured":"Keir Fraser . 2004. Practical lock-freedom . University of Cambridge , Computer Laboratory . http:\/\/www.cl.cam.ac.uk\/techreports\/UCAM-CL-TR-579.pdf Keir Fraser. 2004. Practical lock-freedom. University of Cambridge, Computer Laboratory. http:\/\/www.cl.cam.ac.uk\/techreports\/UCAM-CL-TR-579.pdf"},{"volume-title":"A Pragmatic Implementation of Non-blocking Linked-lists","author":"Harris Timothy L.","key":"e_1_3_2_1_23_1","unstructured":"Timothy L. Harris . 2001. A Pragmatic Implementation of Non-blocking Linked-lists . In Distributed Computing, Jennifer Welch (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg . 300\u2013314. isbn:978-3-540-45414-4 Timothy L. Harris. 2001. A Pragmatic Implementation of Non-blocking Linked-lists. In Distributed Computing, Jennifer Welch (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 300\u2013314. isbn:978-3-540-45414-4"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062247.1062249"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645959.676129"},{"volume-title":"The Art of Multiprocessor Programming","author":"Herlihy Maurice","key":"e_1_3_2_1_27_1","unstructured":"Maurice Herlihy and Nir Shavit . 2008. The Art of Multiprocessor Programming . Morgan Kaufmann Publishers , San Francisco, CA, USA . isbn:0123705916, 9780123705914 Maurice Herlihy and Nir Shavit. 2008. The Art of Multiprocessor Programming. Morgan Kaufmann Publishers, San Francisco, CA, USA. isbn:0123705916, 9780123705914"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385978"},{"key":"e_1_3_2_1_29_1","volume-title":"Read-Copy Update. In In Ottawa Linux Symposium. 338\u2013367","author":"McKenney Paul E.","year":"2001","unstructured":"Paul E. McKenney , Jonathan Appavoo , Andi Kleen , O. Krieger , Orran Krieger , Rusty Russell , Dipankar Sarma , and Maneesh Soni . 2001 . Read-Copy Update. In In Ottawa Linux Symposium. 338\u2013367 . https:\/\/www.kernel.org\/doc\/ols\/2001\/read-copy.pdf Paul E. McKenney, Jonathan Appavoo, Andi Kleen, O. Krieger, Orran Krieger, Rusty Russell, Dipankar Sarma, and Maneesh Soni. 2001. Read-Copy Update. In In Ottawa Linux Symposium. 338\u2013367. https:\/\/www.kernel.org\/doc\/ols\/2001\/read-copy.pdf"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_31_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.. University of Rochester , USA. https:\/\/www.cs.rochester.edu\/u\/scott\/papers\/1995_TR599.pdf Maged M. Michael and Michael L. Scott. 1995. Correction of a Memory Management Method for Lock-Free Data Structures.. University of Rochester, USA. https:\/\/www.cs.rochester.edu\/u\/scott\/papers\/1995_TR599.pdf"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331575"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374540"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Ruslan Nikolaev and Binoy Ravindran. 2021. Snapshot-Free Transparent and Robust Memory Reclamation for Lock-Free Data Structures (arXiv version). arxiv:1905.07903  Ruslan Nikolaev and Binoy Ravindran. 2021. Snapshot-Free Transparent and Robust Memory Reclamation for Lock-Free Data Structures (arXiv version). arxiv:1905.07903","DOI":"10.1145\/3410303"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381052.3381316"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210661"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087588"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.24"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441625"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224988"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178488"}],"event":{"name":"PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Virtual Canada","acronym":"PLDI '21"},"container-title":["Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453483.3454090","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453483.3454090","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453483.3454090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:48Z","timestamp":1750193268000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453483.3454090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,18]]},"references-count":42,"alternative-id":["10.1145\/3453483.3454090","10.1145\/3453483"],"URL":"https:\/\/doi.org\/10.1145\/3453483.3454090","relation":{},"subject":[],"published":{"date-parts":[[2021,6,18]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}