{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:54:55Z","timestamp":1759938895695,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1901381, CCF-1910030, CCF-1919223"],"award-info":[{"award-number":["CCF-1901381, CCF-1910030, CCF-1919223"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,2]]},"DOI":"10.1145\/3503221.3508433","type":"proceedings-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T13:58:22Z","timestamp":1648475902000},"page":"278-293","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Lock-free locks revisited"],"prefix":"10.1145","author":[{"given":"Naama","family":"Ben-David","sequence":"first","affiliation":[{"name":"VMware Research"}]},{"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Yuanhao","family":"Wei","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]}],"member":"320","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"USENIX Annual Technical Conference. 295--306","author":"Arbel-Raviv Maya","year":"2018","unstructured":"Maya Arbel-Raviv, Trevor Brown, and Adam Morrison. 2018. Getting to the Root of Concurrent Binary Search Tree Performance. In USENIX Annual Technical Conference. 295--306."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9420-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/165231.165265"},{"key":"e_1_3_2_1_4_1","unstructured":"R. Bayer and M. Schkolnick. 1988. Concurrency of Operations on B-Trees. Morgan Kaufmann Publishers Inc. San Francisco CA USA 129--139."},{"key":"e_1_3_2_1_5_1","volume-title":"Blelloch","author":"Ben-David Naama","year":"2021","unstructured":"Naama Ben-David and Guy E. Blelloch. 2021. Fast and Fair Lock-Free Locks. arXiv:2108.04520 [cs.DC]"},{"key":"e_1_3_2_1_6_1","volume-title":"Space and Time Bounded Multi-version Garbage Collection. In International Symposium on Distributed Computing (DISC). 12:1--12:20","author":"Ben-David Naama","year":"2021","unstructured":"Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, and Yuanhao Wei. 2021. Space and Time Bounded Multi-version Garbage Collection. In International Symposium on Distributed Computing (DISC). 12:1--12:20."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323187"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Naama Ben-David Guy E. Blelloch and Yuanhao Wei. 2022. Lock-Free Locks Revisited. arXiv:2201.00813 [cs.DC]","DOI":"10.1145\/3503221.3508433"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400254"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210381"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693488"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564912"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484273"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555267"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767415"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694359"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2013.6495002"},{"key":"e_1_3_2_1_19_1","volume-title":"Static Analysis and Compiler Design for Idempotent Processing. In ACM Conference on Programming Language Design and Implementation (PLDI).","author":"de Kruijf Marc A.","year":"2012","unstructured":"Marc A. de Kruijf, Karthikeyan Sankaralingam, and Somesh Jha. 2012. Static Analysis and Compiler Design for Idempotent Processing. In ACM Conference on Programming Language Design and Implementation (PLDI)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/512429.512451"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555269"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835736"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-014-0308-7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233307.1233309"},{"key":"e_1_3_2_1_26_1","volume-title":"LFthreads: A Lock-Free Thread Library. In Conf. on Principles of Distributed Systems (OPODIS).","author":"Gidenstam Anders","year":"2007","unstructured":"Anders Gidenstam and Marina Papatriantafilou. 2007. LFthreads: A Lock-Free Thread Library. In Conf. on Principles of Distributed Systems (OPODIS)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571874"},{"key":"e_1_3_2_1_28_1","volume-title":"International Symposium on Distributed Computing (DISC).","author":"Guerraoui Rachid","year":"2020","unstructured":"Rachid Guerraoui, Alex Kogan, Virendra J Marathe, and Igor Zablotchi. 2020. Efficient multi-word compare and swap. International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.472.0221"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45414-4_21"},{"key":"e_1_3_2_1_31_1","volume-title":"International Symposium on Distributed Computing (DISC). 265--279","author":"Harris Timothy L","year":"2002","unstructured":"Timothy L Harris, Keir Fraser, and Ian A Pratt. 2002. A practical multiword compare-and-swap operation. In International Symposium on Distributed Computing (DISC). 265--279."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11795490_3"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/366062.366084"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1152649.1152653"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/320613.320619"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_3_2_1_38_1","volume-title":"The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases. In IEEE International Conference on Data Engineering (ICDE).","author":"Leis Viktor","year":"2013","unstructured":"Viktor Leis, Alfons Kemper, and Thomas Neumann. 2013. The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases. In IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933349.2933352"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737978"},{"key":"e_1_3_2_1_41_1","volume-title":"Cache Craftiness for Fast Multicore Key-Value Storage. In ACM European Conference on Computer Systems (EuroSys).","author":"Mao Yandong","year":"2012","unstructured":"Yandong Mao, Eddie Kohler, and Robert Tappan Morris. 2012. Cache Craftiness for Fast Multicore Key-Value Storage. In ACM European Conference on Computer Systems (EuroSys)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_3_2_1_43_1","volume-title":"Fast Concurrent Lock-Free Binary Search Trees. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP).","author":"Natarajan Aravind","year":"2014","unstructured":"Aravind Natarajan and Neeraj Mittal. 2014. Fast Concurrent Lock-Free Binary Search Trees. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP)."},{"key":"e_1_3_2_1_45_1","volume-title":"Goodman","author":"Rajwar Ravi","year":"2002","unstructured":"Ravi Rajwar and James R. Goodman. 2002. Transactional lock-free execution of lock-based programs. In International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS). ACM Press, 5--17."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00028"},{"key":"e_1_3_2_1_47_1","unstructured":"Niloufar Shafiei. 2014. Non-Blocking Doubly-Linked Lists with Good Amortized Complexity. arXiv:1408.1935 [cs.DC]"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050028"},{"volume-title":"Extremely fast (a, b)-trees at all contention levels. Master's thesis","author":"Srivastava Anubhav","key":"e_1_3_2_1_49_1","unstructured":"Anubhav Srivastava. 2021. Extremely fast (a, b)-trees at all contention levels. Master's thesis. University of Waterloo."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.03.001"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555261"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"John Turek Dennis Shasha and Sundeep Prakash. 1992. Locking without blocking: making lock based concurrent data structure algorithms nonblocking. In Principles of Database Systems (PODS). 212--222.","DOI":"10.1145\/137097.137873"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00049"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196895"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460874"}],"event":{"name":"PPoPP '22: 27th 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":"Seoul Republic of Korea","acronym":"PPoPP '22"},"container-title":["Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503221.3508433","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3503221.3508433","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3503221.3508433","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3503221.3508433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:39Z","timestamp":1750191099000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503221.3508433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":53,"alternative-id":["10.1145\/3503221.3508433","10.1145\/3503221"],"URL":"https:\/\/doi.org\/10.1145\/3503221.3508433","relation":{},"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"2022-03-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}