{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T17:04:57Z","timestamp":1751648697453,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,11]]},"DOI":"10.1145\/2935764.2935790","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"349-359","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Fast and Robust Memory Reclamation for Concurrent Data Structures"],"prefix":"10.1145","author":[{"given":"Oana","family":"Balmau","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}]},{"given":"Igor","family":"Zablotchi","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611483"},{"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\/2755573.2755600"},{"key":"e_1_3_2_1_4_1","volume-title":"USENIX Annual Technical Conference","author":"Arcangeli A.","year":"2003","unstructured":"A. Arcangeli , M. Cao , P. E. McKenney , and D. Sarma . Using read-copy-update techniques for System V IPC in the Linux 2.5 kernel . USENIX Annual Technical Conference 2003 . A. Arcangeli, M. Cao, P. E. McKenney, and D. Sarma. Using read-copy-update techniques for System V IPC in the Linux 2.5 kernel. USENIX Annual Technical Conference 2003."},{"key":"e_1_3_2_1_5_1","volume-title":"EPFL","author":"Balmau O.","year":"2016","unstructured":"O. Balmau , R. Guerraoui , M. Herlihy , and I. Zablotchi . Fast and Robust Memory Reclamation for Concurrent Data Structures. Technical report , EPFL , 2016 . O. Balmau, R. Guerraoui, M. Herlihy, and I. Zablotchi. Fast and Robust Memory Reclamation for Concurrent Data Structures. Technical report, EPFL, 2016."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486184"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814298"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694359"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384016"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993821"},{"key":"e_1_3_2_1_12_1","unstructured":"K. Fraser. Practical lock-freedom. PhD thesis University of Cambridge Computer Laboratory 2004.  K. Fraser. Practical lock-freedom. PhD thesis University of Cambridge Computer Laboratory 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.167"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062247.1062249"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/645959.676129"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_19_1","volume-title":"Revised Reprint","author":"Herlihy M.","year":"2012","unstructured":"M. Herlihy and N. Shavit . The Art of Multiprocessor Programming , Revised Reprint . 1 st edition, 2012 . M. Herlihy and N. Shavit. The Art of Multiprocessor Programming, Revised Reprint. 1st edition, 2012.","edition":"1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989503"},{"key":"e_1_3_2_1_21_1","volume-title":"Linux System Programming: Talking Directly to the Kernel and C Library","author":"Love R.","unstructured":"R. Love . Linux System Programming: Talking Directly to the Kernel and C Library , 2 nd Edition. O'Reilly Media, Inc. R. Love. Linux System Programming: Talking Directly to the Kernel and C Library, 2nd Edition. O'Reilly Media, Inc.","edition":"2"},{"key":"e_1_3_2_1_22_1","volume-title":"a hardware view for software hackers","author":"McKenney P. E.","year":"2010","unstructured":"P. E. McKenney . Memory barriers : a hardware view for software hackers . 2010 . P. E. McKenney. Memory barriers: a hardware view for software hackers. 2010."},{"key":"e_1_3_2_1_23_1","volume-title":"Ottawa Linux Symposium","author":"McKenney P. E.","year":"2001","unstructured":"P. E. McKenney , D. Sarma , A. Arcangeli , A. Kleen , O. Krieger , and R. Russell . Read copy update . Ottawa Linux Symposium 2001 . P. E. McKenney, D. Sarma, A. Arcangeli, A. Kleen, O. Krieger, and R. Russell. Read copy update. Ottawa Linux Symposium 2001."},{"key":"e_1_3_2_1_24_1","volume-title":"PDCS","author":"McKenney P. E.","year":"1998","unstructured":"P. E. McKenney and J. D. Slingwine . Read-copy update: Using execution history to solve concurrency problems . PDCS 1998 . P. E. McKenney and J. D. Slingwine. Read-copy update: Using execution history to solve concurrency problems. PDCS 1998."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564881"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694374"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_27"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555261"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224988"}],"event":{"name":"SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Pacific Grove California USA","acronym":"SPAA '16"},"container-title":["Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935790","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:57Z","timestamp":1750217997000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":31,"alternative-id":["10.1145\/2935764.2935790","10.1145\/2935764"],"URL":"https:\/\/doi.org\/10.1145\/2935764.2935790","relation":{},"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}