{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:44:05Z","timestamp":1753602245814,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Natural Science and Engineering Research Council of Canada","award":["RGPIN\/2019-04852"],"award-info":[{"award-number":["RGPIN\/2019-04852"]}]},{"DOI":"10.13039\/501100001804","name":"Canada Research Chairs","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001804","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467938","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"533-543","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion"],"prefix":"10.1145","author":[{"given":"David Yu Cheng","family":"Chan","sequence":"first","affiliation":[{"name":"University of Calgary, Calgary, AB, Canada"}]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[{"name":"University of Calgary, Calgary, AB, Canada"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"221","article-title":"An Improved Lower Bound for the Time Complexity of Mutual Exclusion","volume":"15","author":"Anderson James H.","year":"2002","unstructured":"James H. Anderson and Yong-Jik Kim . 2002 . An Improved Lower Bound for the Time Complexity of Mutual Exclusion . DistComp , Vol. 15 (2002), 221 -- 253 . James H. Anderson and Yong-Jik Kim. 2002. An Improved Lower Bound for the Time Complexity of Mutual Exclusion. DistComp, Vol. 15 (2002), 221--253.","journal-title":"DistComp"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Hagit Attiya Danny Hendler and Philipp Woelfel. 2008. Tight RMR Lower Bounds for Mutual Exclusion and Other Problems. In STOC40th. 217--226.  Hagit Attiya Danny Hendler and Philipp Woelfel. 2008. Tight RMR Lower Bounds for Mutual Exclusion and Other Problems. In STOC40th. 217--226.","DOI":"10.1145\/1374376.1374410"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"David Yu Cheng Chan and Philipp Woelfel. 2020. Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives. In nPODC2020. ACM 181--190. https:\/\/doi.org\/10.1145\/3382734.3405736  David Yu Cheng Chan and Philipp Woelfel. 2020. Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives. In nPODC2020. ACM 181--190. https:\/\/doi.org\/10.1145\/3382734.3405736","DOI":"10.1145\/3382734.3405736"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Sahil Dhoked and Neeraj Mittal. 2020. An Adaptive Approach to Recoverable Mutual Exclusion. In nPODC2020. ACM 1--10. https:\/\/doi.org\/10.1145\/3382734.3405739  Sahil Dhoked and Neeraj Mittal. 2020. An Adaptive Approach to Recoverable Mutual Exclusion. In nPODC2020. ACM 1--10. https:\/\/doi.org\/10.1145\/3382734.3405739","DOI":"10.1145\/3382734.3405739"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Wojciech Golab and Danny Hendler. 2017. Recoverable Mutual Exclusion in Sub-logarithmic Time. In nPODC2017. ACM 211--220. https:\/\/doi.org\/10.1145\/3087801.3087819  Wojciech Golab and Danny Hendler. 2017. Recoverable Mutual Exclusion in Sub-logarithmic Time. In nPODC2017. ACM 211--220. https:\/\/doi.org\/10.1145\/3087801.3087819","DOI":"10.1145\/3087801.3087819"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Wojciech Golab and Danny Hendler. 2018. Recoverable Mutual Exclusion Under System-Wide Failures. In nPODC2018. ACM 17--26. https:\/\/doi.org\/10.1145\/3212734.3212755  Wojciech Golab and Danny Hendler. 2018. Recoverable Mutual Exclusion Under System-Wide Failures. In nPODC2018. ACM 17--26. https:\/\/doi.org\/10.1145\/3212734.3212755","DOI":"10.1145\/3212734.3212755"},{"key":"e_1_3_2_2_9_1","first-page":"535","article-title":"Recoverable mutual exclusion","volume":"32","author":"Golab Wojciech","year":"2019","unstructured":"Wojciech Golab and Aditya Ramaraju . 2019 . Recoverable mutual exclusion . DistComp , Vol. 32 , 6 (2019), 535 -- 564 . https:\/\/doi.org\/10.1007\/s00446-019-00364-0 Wojciech Golab and Aditya Ramaraju. 2019. Recoverable mutual exclusion. DistComp, Vol. 32, 6 (2019), 535--564. https:\/\/doi.org\/10.1007\/s00446-019-00364-0","journal-title":"DistComp"},{"key":"e_1_3_2_2_10_1","volume-title":"NETYS6th (LNCS","volume":"206","author":"Jayanti Prasad","year":"2018","unstructured":"Prasad Jayanti , Siddhartha Jayanti , and Anup Joshi . 2018 . Optimal Recoverable Mutual Exclusion Using only FASAS . In NETYS6th (LNCS , Vol. 11028). Springer, 191-- 206 . https:\/\/doi.org\/10.1007\/978-3-030-05529-5_13 Prasad Jayanti, Siddhartha Jayanti, and Anup Joshi. 2018. Optimal Recoverable Mutual Exclusion Using only FASAS. In NETYS6th (LNCS, Vol. 11028). Springer, 191--206. https:\/\/doi.org\/10.1007\/978-3-030-05529-5_13"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Prasad Jayanti Siddhartha V. Jayanti and Anup Joshi. 2019. A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM. In nPODC2019. ACM 177--186. https:\/\/doi.org\/10.1145\/3293611.3331634  Prasad Jayanti Siddhartha V. Jayanti and Anup Joshi. 2019. A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM. In nPODC2019. ACM 177--186. https:\/\/doi.org\/10.1145\/3293611.3331634","DOI":"10.1145\/3293611.3331634"},{"key":"e_1_3_2_2_12_1","volume-title":"DISC31st (LIPIcs","volume":"15","author":"Jayanti Prasad","year":"2017","unstructured":"Prasad Jayanti and Anup Joshi . 2017 . Recoverable FCFS Mutual Exclusion with Wait-Free Recovery . In DISC31st (LIPIcs , Vol. 91). 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 DISC31st (LIPIcs, Vol. 91). 30:1--30:15. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2017.30"},{"key":"e_1_3_2_2_13_1","first-page":"1","article-title":"Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity. In PODIS 24th (LIPIcs, Vol. 184)","volume":"15","author":"Katzan Daniel","year":"2020","unstructured":"Daniel Katzan and Adam Morrison . 2020 . Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity. In PODIS 24th (LIPIcs, Vol. 184) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 15 : 1 -- 15 :16. https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2020.15 Daniel Katzan and Adam Morrison. 2020. Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity. In PODIS 24th (LIPIcs, Vol. 184). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 15:1--15:16. https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2020.15","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1994.288305"},{"key":"e_1_3_2_2_15_1","first-page":"21","article-title":"Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors","volume":"9","author":"Mellor-Crummey John M.","year":"1991","unstructured":"John M. Mellor-Crummey and Michael L. Scott . 1991 . Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors . ACMTOCS , Vol. 9 , 1 (1991), 21 -- 65 . John M. Mellor-Crummey and Michael L. Scott. 1991. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. ACMTOCS, Vol. 9, 1 (1991), 21--65.","journal-title":"ACMTOCS"},{"volume-title":"RGLock: Recoverable mutual exclusion for non-volatile main memorysystems. Master's thesis","author":"Ramaraju Aditya","key":"e_1_3_2_2_16_1","unstructured":"Aditya Ramaraju . 2015. RGLock: Recoverable mutual exclusion for non-volatile main memorysystems. Master's thesis . University of Waterloo . https:\/\/uwspace.uwaterloo.ca\/handle\/10012\/9473 Aditya Ramaraju. 2015. RGLock: Recoverable mutual exclusion for non-volatile main memorysystems. Master's thesis. University of Waterloo. https:\/\/uwspace.uwaterloo.ca\/handle\/10012\/9473"},{"key":"e_1_3_2_2_17_1","first-page":"51","article-title":"A Fast","volume":"9","author":"Yang Jae-Heon","year":"1995","unstructured":"Jae-Heon Yang and James H. Anderson . 1995 . A Fast , Scalable Mutual Exclusion Algorithm. DistComp , Vol. 9 , 1 (1995), 51 -- 60 . Jae-Heon Yang and James H. Anderson. 1995. A Fast, Scalable Mutual Exclusion Algorithm. DistComp, Vol. 9, 1 (1995), 51--60.","journal-title":"Scalable Mutual Exclusion Algorithm. DistComp"}],"event":{"name":"PODC '21: 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":"Virtual Event Italy","acronym":"PODC '21"},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467938","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":15,"alternative-id":["10.1145\/3465084.3467938","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467938","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}