{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:19Z","timestamp":1750220179378,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ontario Early Researcher Award"},{"name":"Natural Sciences and Engineering Research Council of Canada (NSERC)"},{"name":"Google Faculty Research Award"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538594","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"295-305","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A NUMA-Aware Recoverable Mutex Lock"],"prefix":"10.1145","author":[{"given":"Ahmed","family":"Fahmy","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}]},{"given":"Wojciech","family":"Golab","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.80120"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1946143.1946154"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858788.2688503"},{"key":"e_1_3_2_1_4_1","volume-title":"Article 22 (February","author":"Chabbi Milind","year":"2016","unstructured":"Milind Chabbi and John Mellor-Crummey . 2016. Contention-Conscious, Locality-Preserving Locks . ACM SIGPLAN Notices 51, 8 , Article 22 (February 2016 ), 14 pages. https:\/\/doi.org\/10.1145\/3016078.2851166 10.1145\/3016078.2851166 Milind Chabbi and John Mellor-Crummey. 2016. Contention-Conscious, Locality-Preserving Locks. ACM SIGPLAN Notices 51, 8, Article 22 (February 2016), 14 pages. https:\/\/doi.org\/10.1145\/3016078.2851166"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405736"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467938"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405739"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303984"},{"key":"e_1_3_2_1_10_1","volume-title":"Fissile Locks. In Proceedings of the 8th Networked Systems (NETYS","author":"Dice Dave","year":"2020","unstructured":"Dave Dice and Alex Kogan . 2020 . Fissile Locks. In Proceedings of the 8th Networked Systems (NETYS 2020). Springer, Berlin, Heidelberg, 192--208. https:\/\/doi.org\/10.1007\/978--3-030--67087-0_13 10.1007\/978--3-030--67087-0_13 Dave Dice and Alex Kogan. 2020. Fissile Locks. In Proceedings of the 8th Networked Systems (NETYS 2020). Springer, Berlin, Heidelberg, 192--208. https:\/\/doi.org\/10.1007\/978--3-030--67087-0_13"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989502"},{"key":"e_1_3_2_1_12_1","article-title":"Lock Cohorting: A General Technique for Designing NUMA Locks","volume":"1","author":"Dice David","year":"2015","unstructured":"David Dice , Virendra J. Marathe , and Nir Shavit . 2015 . Lock Cohorting: A General Technique for Designing NUMA Locks . ACM Transaction on Parallel Computing 1 , 2, Article 13 (February 2015), 42 pages. https:\/\/doi.org\/10.1145\/2686884 10.1145\/2686884 David Dice, Virendra J. Marathe, and Nir Shavit. 2015. Lock Cohorting: A General Technique for Designing NUMA Locks. ACM Transaction on Parallel Computing 1, 2, Article 13 (February 2015), 42 pages. https:\/\/doi.org\/10.1145\/2686884","journal-title":"ACM Transaction on Parallel Computing"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"Solution of a Problem in Concurrent Programming","volume":"26","author":"Dijkstra E. W.","year":"1983","unstructured":"E. W. Dijkstra . 1983 . Solution of a Problem in Concurrent Programming Control. Commun. ACM 26 , 1 (January 1983), 21--22. https:\/\/doi.org\/10.1145\/357980.357989 10.1145\/357980.357989 E. W. Dijkstra. 1983. Solution of a Problem in Concurrent Programming Control. Commun. ACM 26, 1 (January 1983), 21--22. https:\/\/doi.org\/10.1145\/357980.357989","journal-title":"Control. Commun. ACM"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087819"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212755"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-019-00364-0"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05529-5_13"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331634"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of 31st International Symposium on Distributed Computing (DISC","volume":"15","author":"Jayanti Prasad","year":"2017","unstructured":"Prasad Jayanti and Anup Joshi . 2017 . Recoverable FCFS Mutual Exclusion with Wait-Free Recovery . In Proceedings of 31st International Symposium on Distributed Computing (DISC , Vol. 91). Dagstuhl, Germany, 30:1--30: 15 . https:\/\/doi.org\/10. 4230\/LIPIcs.DISC.2017.30 Prasad Jayanti and Anup Joshi. 2017. Recoverable FCFS Mutual Exclusion with Wait-Free Recovery. In Proceedings of 31st International Symposium on Distributed Computing (DISC, Vol. 91). Dagstuhl, Germany, 30:1--30:15. https:\/\/doi.org\/10. 4230\/LIPIcs.DISC.2017.30"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-31277-0_14"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359629"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the 2017 USENIX Conference on Usenix Annual Technical Conference (USENIX ATC '17). USENIX Association, USA, 603--615","author":"Kashyap Sanidhya","year":"2017","unstructured":"Sanidhya Kashyap , Changwoo Min , and Taesoo Kim . 2017 . Scalable NUMAAware Blocking Synchronization Primitives . In Proceedings of the 2017 USENIX Conference on Usenix Annual Technical Conference (USENIX ATC '17). USENIX Association, USA, 603--615 . Sanidhya Kashyap, Changwoo Min, and Taesoo Kim. 2017. Scalable NUMAAware Blocking Synchronization Primitives. In Proceedings of the 2017 USENIX Conference on Usenix Annual Technical Conference (USENIX ATC '17). USENIX Association, USA, 603--615."},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS 2020","volume":"16","author":"Katzan Daniel","year":"2021","unstructured":"Daniel Katzan and Adam Morrison . 2021 . Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity . In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS 2020 , Vol. 184). Dagstuhl, Germany, 15:1--15: 16 . https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2020.15 10.4230\/LIPIcs.OPODIS.2020.15 Daniel Katzan and Adam Morrison. 2021. Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity. In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS 2020, Vol. 184). Dagstuhl, Germany, 15:1--15:16. https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2020.15"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 2012 USENIX Conference on Usenix Annual Technical Conference (USENIX ATC '12). USENIX Association","author":"Lozi Jean-Pierre","year":"2012","unstructured":"Jean-Pierre Lozi , Florian David , Ga\u00ebl Thomas , Julia Lawall , and Gilles Muller . 2012 . Remote Core Locking: Migrating Critical-Section Execution to Improve the Performance of Multithreaded Applications . In Proceedings of the 2012 USENIX Conference on Usenix Annual Technical Conference (USENIX ATC '12). USENIX Association , Boston, MA, 65--76. Jean-Pierre Lozi, Florian David, Ga\u00ebl Thomas, Julia Lawall, and Gilles Muller. 2012. Remote Core Locking: Migrating Critical-Section Execution to Improve the Performance of Multithreaded Applications. In Proceedings of the 2012 USENIX Conference on Usenix Annual Technical Conference (USENIX ATC '12). USENIX Association, Boston, MA, 65--76."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823285_84"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645604.662740"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/103727.103729"},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the 9th International Symposium on High-Performance Computer Architecture (HPCA-9","volume":"252","author":"Radovi Z.","year":"2003","unstructured":"Z. Radovi and E. Hagersten . 2003. Hierarchical backoff locks for nonuniform communication architectures . In Proceedings of the 9th International Symposium on High-Performance Computer Architecture (HPCA-9 , Vol. 12). IEEE, 241-- 252 . https:\/\/doi.org\/10.1109\/HPCA. 2003 .1183542 10.1109\/HPCA.2003.1183542 Z. Radovi and E. Hagersten. 2003. Hierarchical backoff locks for nonuniform communication architectures. In Proceedings of the 9th International Symposium on High-Performance Computer Architecture (HPCA-9, Vol. 12). IEEE, 241--252. https:\/\/doi.org\/10.1109\/HPCA.2003.1183542"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400269"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01784242"}],"event":{"name":"SPAA '22: 34th 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","EATCS European Association for Theoretical Computer Science"],"location":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538594","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:10Z","timestamp":1750186930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":29,"alternative-id":["10.1145\/3490148.3538594","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538594","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}