{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:55Z","timestamp":1750220335109,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (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,7,20]]},"DOI":"10.1145\/3519270.3538448","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"187-197","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast and Fair Randomized Wait-Free Locks"],"prefix":"10.1145","author":[{"given":"Naama","family":"Ben-David","sequence":"first","affiliation":[{"name":"VMware Research, Palo Alto, CA, USA"}]},{"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/62546.62594"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225271"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/259380.259431"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814598"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611483"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454060"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502105"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146428"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/165231.165265"},{"key":"e_1_3_2_2_10_1","volume-title":"Concurrency of Operations on B-Trees, page 129--139","author":"Bayer R.","year":"1988","unstructured":"R. Bayer and M. Schkolnick . Concurrency of Operations on B-Trees, page 129--139 . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA, 1988 . R. Bayer and M. Schkolnick. Concurrency of Operations on B-Trees, page 129--139. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1988."},{"key":"e_1_3_2_2_11_1","volume-title":"Fast and fair lock-free locks. CoRR, abs\/2108.04520","author":"Ben-David Naama","year":"2021","unstructured":"Naama Ben-David and Guy E. Blelloch . Fast and fair lock-free locks. CoRR, abs\/2108.04520 , 2021 . Naama Ben-David and Guy E. Blelloch. Fast and fair lock-free locks. CoRR, abs\/2108.04520, 2021."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323187"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508433"},{"key":"e_1_3_2_2_14_1","volume-title":"Space Efficient Implementations Using Only Pointer-Width CAS. In International Symposium on Distributed Computing (DISC)","author":"Guy","year":"2020","unstructured":"Guy E. Blelloch and Yuanhao Wei. LL\/SC and Atomic Copy: Constant Time , Space Efficient Implementations Using Only Pointer-Width CAS. In International Symposium on Distributed Computing (DISC) , 2020 . Guy E. Blelloch and Yuanhao Wei. LL\/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS. In International Symposium on Distributed Computing (DISC), 2020."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693488"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564912"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790192635"},{"key":"e_1_3_2_2_18_1","volume-title":"Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(1)","author":"Cole Richard","year":"1986","unstructured":"Richard Cole and Uzi Vishkin . Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(1) , 1986 . Richard Cole and Uzi Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(1), 1986."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2013.6495002"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254120"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555269"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35608-2_15"},{"key":"e_1_3_2_2_23_1","volume-title":"Concurrent programming without locks. ACM Transactions on Computer Systems (TOCS), 25(2):5--es","author":"Fraser Keir","year":"2007","unstructured":"Keir Fraser and Tim Harris . Concurrent programming without locks. ACM Transactions on Computer Systems (TOCS), 25(2):5--es , 2007 . Keir Fraser and Tim Harris. Concurrent programming without locks. ACM Transactions on Computer Systems (TOCS), 25(2):5--es, 2007."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214066"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.60"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993687"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073863"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11795490_3"},{"key":"e_1_3_2_2_29_1","volume-title":"January","author":"Herlihy Maurice","year":"1991","unstructured":"Maurice Herlihy . Wait-free synchronization. ACM Transactions on Programming Languages and Systems (TOPLAS), 13(1):124--149 , January 1991 . Maurice Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems (TOPLAS), 13(1):124--149, January 1991."},{"key":"e_1_3_2_2_30_1","volume-title":"Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 12(3)","author":"Herlihy Maurice P.","year":"1990","unstructured":"Maurice P. Herlihy and Jeanette M. Wing . Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 12(3) , 1990 . Maurice P. Herlihy and Jeanette M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 12(3), 1990."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/366062.366084"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/320613.320619"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/135419.135468"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01786228"},{"key":"e_1_3_2_2_36_1","first-page":"133","volume-title":"ACM Symposium on Principles of Programming Languages (POPL)","author":"Lehmann Daniel","year":"1981","unstructured":"Daniel Lehmann and Michael O. Rabin . On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem . In ACM Symposium on Principles of Programming Languages (POPL) , pages 133 -- 138 , 1981 . Daniel Lehmann and Michael O. Rabin. On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem. In ACM Symposium on Principles of Programming Languages (POPL), pages 133--138, 1981."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933349.2933352"},{"key":"e_1_3_2_2_38_1","volume-title":"Uncertainty in Artificial Intelligence (UAI)","author":"Low Yucheng","year":"2010","unstructured":"Yucheng Low , Joseph E Gonzalez , Aapo Kyrola , Danny Bickson , Carlos E Guestrin , and Joseph Hellerstein . Graphlab : A newframework for parallel machine learning . Uncertainty in Artificial Intelligence (UAI) , 2010 . Yucheng Low, Joseph E Gonzalez, Aapo Kyrola, Danny Bickson, Carlos E Guestrin, and Joseph Hellerstein. Graphlab: A newframework for parallel machine learning. Uncertainty in Artificial Intelligence (UAI), 2010."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198117"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_2_42_1","first-page":"407","volume-title":"IEEE Symposium on Foundations of Computer Science (FOCS)","author":"Rabin Michael O.","year":"1980","unstructured":"Michael O. Rabin . N-process synchronization by 4 log2 n-valued shared variables . In IEEE Symposium on Foundations of Computer Science (FOCS) , pages 407 -- 410 , 1980 . Michael O. Rabin. N-process synchronization by 4 log2 n-valued shared variables. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 407--410, 1980."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/135419.135466"},{"key":"e_1_3_2_2_44_1","volume-title":"International Symposium on Algorithms and Computation (ISAAC)","author":"Wattenhofer R.","year":"2009","unstructured":"Wattenhofer R. Schneider J. Bounds on contention management algorithms . In International Symposium on Algorithms and Computation (ISAAC) , 2009 . Wattenhofer R. Schneider J. Bounds on contention management algorithms. In International Symposium on Algorithms and Computation (ISAAC), 2009."},{"key":"e_1_3_2_2_45_1","first-page":"4","article-title":"A competitive analysis for balanced transactional memory workloads","author":"Sharma G.","year":"2012","unstructured":"G. Sharma and C Busch . A competitive analysis for balanced transactional memory workloads . Algorithmica , 4 , 2012 . G. Sharma and C Busch. A competitive analysis for balanced transactional memory workloads. Algorithmica, 4, 2012.","journal-title":"Algorithmica"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050028"},{"key":"e_1_3_2_2_47_1","volume-title":"MIT CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB","author":"Steele Guy Lewis","year":"1976","unstructured":"Guy Lewis Steele Jr and Gerald Jay Sussman . Lambda : The ultimate imperative. Technical report , MIT CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB , 1976 . Guy Lewis Steele Jr and Gerald Jay Sussman. Lambda: The ultimate imperative. Technical report, MIT CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB, 1976."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/137097.137873"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538448","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538448","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":47,"alternative-id":["10.1145\/3519270.3538448","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538448","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}