{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:22:01Z","timestamp":1753600921964,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T00:00:00Z","timestamp":1572912000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T00:00:00Z","timestamp":1572912000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["Discovery Grant"],"award-info":[{"award-number":["Discovery Grant"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Faculty Research Awards"],"award-info":[{"award-number":["Faculty Research Awards"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ontario Early Researcher Awards Program"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00446-019-00364-0","type":"journal-article","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T06:04:26Z","timestamp":1572933866000},"page":"535-564","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Recoverable mutual exclusion"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8891-256X","authenticated-orcid":false,"given":"Wojciech","family":"Golab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Ramaraju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,5]]},"reference":[{"issue":"6","key":"364_CR1","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1145\/227683.227688","volume":"42","author":"Y Afek","year":"1995","unstructured":"Afek, Y., Greenberg, D.S., Merritt, M., Taubenfeld, G.: Computing with faulty shared objects. J. ACM 42(6), 1231\u20131274 (1995)","journal-title":"J. ACM"},{"issue":"1","key":"364_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/PL00008923","volume":"14","author":"J Anderson","year":"2001","unstructured":"Anderson, J., Kim, Y.-J.: A new fast-path mechanism for mutual exclusion. Distrib. Comput. 14(1), 17\u201329 (2001)","journal-title":"Distrib. Comput."},{"issue":"4","key":"364_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00446-002-0084-2","volume":"15","author":"J Anderson","year":"2002","unstructured":"Anderson, J., Kim, Y.-J.: An improved lower bound for the time complexity of mutual exclusion. Distrib. Comput. 15(4), 221\u2013253 (2002)","journal-title":"Distrib. Comput."},{"issue":"2\u20133","key":"364_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00446-003-0088-6","volume":"16","author":"J Anderson","year":"2003","unstructured":"Anderson, J., Kim, Y.-J., Herman, T.: Shared-memory mutual exclusion: major research trends since 1986. Distrib. Comput. 16(2\u20133), 75\u2013110 (2003)","journal-title":"Distrib. Comput."},{"issue":"1","key":"364_CR5","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"T Anderson","year":"1990","unstructured":"Anderson, T.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst. 1(1), 6\u201316 (1990)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"364_CR6","doi-asserted-by":"crossref","unstructured":"Attiya, H., Hendler, D., Woelfel, P.: Tight RMR lower bounds for mutual exclusion and other problems. In: Proceedings of the 40th ACM symposium on theory of computing (STOC), pp. 217\u2013226 (2008)","DOI":"10.1145\/1374376.1374410"},{"key":"364_CR7","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Gilbert, S.: Mutual exclusion with $$O(\\log ^{2}\\log n)$$ amortized work. In: Proceedings of the 52nd symposium on foundations of computer science (FOCS), pp. 728\u2013737 (2011)","DOI":"10.1109\/FOCS.2011.84"},{"key":"364_CR8","unstructured":"Bohannon, P., Lieuwen, D.F., Silberschatz, A.: Recovering scalable spin locks. In: Proceedings of the 8th IEEE symposium on parallel and distributed processing (SPDP), pp. 314\u2013322 (1996)"},{"key":"364_CR9","unstructured":"Bohannon, P., Lieuwen, D.F., Silberschatz, A., Sudarshan, S., Gava, J.: Recoverable user-level mutual exclusion. In: Proceedings of the 7th IEEE symposium on parallel and distributed processing (SPDP), pp. 293\u2013301 (1995)"},{"issue":"2","key":"364_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"JE Burns","year":"1993","unstructured":"Burns, J.E., Lynch, N.A.: Bounds on shared memory for mutual exclusion. Inf. Comput. 107(2), 171\u2013184 (1993)","journal-title":"Inf. Comput."},{"key":"364_CR11","doi-asserted-by":"crossref","unstructured":"Cypher, R.: The communication requirements of mutual exclusion. In: Proceedings of the 7th ACM symposium on parallel algorithms and architectures (SPAA), pp. 147\u2013156 (1995)","DOI":"10.1145\/215399.215434"},{"issue":"9","key":"364_CR12","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"EW Dijkstra","year":"1965","unstructured":"Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)","journal-title":"Commun. ACM"},{"issue":"11","key":"364_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"364_CR14","doi-asserted-by":"crossref","unstructured":"Fan, R., Lynch, N.: An $$\\Omega (n \\log n)$$ lower bound on the cost of mutual exclusion. In: Proceedings of the 25th ACM symposium on principles of distributed computing (PODC), pp. 275\u2013284 (2006)","DOI":"10.1145\/1146381.1146423"},{"key":"364_CR15","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Woelfel, P.: Randomized mutual exclusion with constant amortized RMR complexity on the DSM. In: Proceedings of the 55th symposium on foundations of computer science (FOCS), pp. 504\u2013513 (2014)","DOI":"10.1109\/FOCS.2014.60"},{"key":"364_CR16","doi-asserted-by":"crossref","unstructured":"Gibbons, P.B.: How emerging memory technologies will have you rethinking algorithm design. In: Proceedings of the 35th ACM symposium on principles of distributed computing (PODC), p. 303 (2016)","DOI":"10.1145\/2933057.2933124"},{"issue":"2","key":"364_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00446-011-0150-8","volume":"25","author":"W Golab","year":"2012","unstructured":"Golab, W., Hadzilacos, V., Hendler, D., Woelfel, P.: RMR-efficient implementations of comparison primitives using read and write operations. Distrib. Comput. 25(2), 109\u2013162 (2012)","journal-title":"Distrib. Comput."},{"key":"364_CR18","doi-asserted-by":"crossref","unstructured":"Golab, W., Hendler, D.: Recoverable mutual exclusion in sub-logarithmic time. In: Proceedings of the 36th annual ACM symposium on principles of distributed computing (PODC), pp. 211\u2013220 (2017)","DOI":"10.1145\/3087801.3087819"},{"key":"364_CR19","doi-asserted-by":"crossref","unstructured":"Golab, W., Hendler, D.: Recoverable mutual exclusion under system-wide failures. In: Proceedings of the 37th annual ACM symposium on principles of distributed computing (PODC), pp. 17\u201326 (2018)","DOI":"10.1145\/3212734.3212755"},{"key":"364_CR20","doi-asserted-by":"crossref","unstructured":"Golab, W., Ramaraju, A.: Recoverable mutual exclusion. In: Proceedings of the 35th ACM symposium on principles of distributed computing (PODC), pp. 65\u201374 (2016)","DOI":"10.1145\/2933057.2933087"},{"issue":"6","key":"364_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/2.55501","volume":"23","author":"G Graunke","year":"1990","unstructured":"Graunke, G., Thakkar, S.: Synchronization algorithms for shared-memory multiprocessors. IEEE Comput. 23(6), 60\u201369 (1990)","journal-title":"IEEE Comput."},{"key":"364_CR22","volume-title":"Transaction processing: concepts and techniques","author":"J Gray","year":"1993","unstructured":"Gray, J., Reuter, A.: Transaction processing: concepts and techniques. Morgan Kaufmann, Burlington (1993)"},{"issue":"1","key":"364_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00446-011-0128-6","volume":"24","author":"D Hendler","year":"2011","unstructured":"Hendler, D., Woelfel, P.: Randomized mutual exclusion with sub-logarithmic RMR-complexity. Distrib. Comput. 24(1), 3\u201319 (2011)","journal-title":"Distrib. Comput."},{"issue":"1","key":"364_CR24","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"364_CR25","doi-asserted-by":"crossref","unstructured":"Hoepman, J.-H., Papatriantafilou, M., Tsigas, P.: Self-stabilization of wait-free shared memory objects. In: Proceedings of the 9th international workshop on distributed algorithms (WDAG), pp. 273\u2013287 (1995)","DOI":"10.1007\/BFb0022153"},{"key":"364_CR26","unstructured":"Intel Corporation. Single-chip cloud computer. \nhttp:\/\/www.intel.com\/content\/dam\/www\/public\/us\/en\/documents\/technology-briefs\/intel-labs-single-chip-cloud-overview-paper.pdf\n\n. Accessed 31 Oct 2019"},{"key":"364_CR27","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: F-arrays: implementation and applications. In: Proceedings of the 21st annual ACM symposium on principles of distributed computing (PODC), pp. 270\u2013279 (2002)","DOI":"10.1145\/571825.571875"},{"issue":"3","key":"364_CR28","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/278298.278305","volume":"45","author":"P Jayanti","year":"1998","unstructured":"Jayanti, P., Chandra, T., Toueg, S.: Fault-tolerant wait-free shared objects. J. ACM 45(3), 451\u2013500 (1998)","journal-title":"J. ACM"},{"key":"364_CR29","unstructured":"Jayanti, P., Joshi, A.: Recoverable FCFS mutual exclusion with wait-free recovery. In: Proceedings of the 31st international symposium on distributed computing (DISC), pp. 30:1\u201330:15 (2017)"},{"key":"364_CR30","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Jayanti, S., Joshi, A.: A recoverable Mutex algorithm with sub-logarithmic RMR on both CC and DSM. In: Proceedings of the 38th annual ACM symposium on principles of distributed computing (PODC), pp. 177\u2013186 (2019)","DOI":"10.1145\/3293611.3331634"},{"key":"364_CR31","doi-asserted-by":"crossref","unstructured":"Johnen, C., Higham, L.: Fault-tolerant implementations of regular registers by safe registers with applications to networks. In: Proceedings of 10th international conference of distributed computing and networking (ICDCN), pp. 337\u2013348 (2009)","DOI":"10.1007\/978-3-540-92295-7_41"},{"issue":"1","key":"364_CR32","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0020-0190(02)00224-7","volume":"84","author":"Y-J Kim","year":"2002","unstructured":"Kim, Y.-J., Anderson, J.H.: A space- and time-efficient local-spin spin lock. Inf. Process. Lett. 84(1), 47\u201355 (2002)","journal-title":"Inf. Process. Lett."},{"key":"364_CR33","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF00288966","volume":"17","author":"J Kessels","year":"1982","unstructured":"Kessels, J.: Arbitration without common modifiable variables. Acta Informatica 17, 135\u2013141 (1982)","journal-title":"Acta Informatica"},{"issue":"8","key":"364_CR34","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Commun. ACM 17(8), 453\u2013455 (1974)","journal-title":"Commun. ACM"},{"issue":"2","key":"364_CR35","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: part I\u2014a theory of interprocess communication. J. ACM 33(2), 313\u2013326 (1986)","journal-title":"J. ACM"},{"issue":"2","key":"364_CR36","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1145\/5383.5385","volume":"33","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: part II\u2014statement and solutions. J. ACM 33(2), 327\u2013348 (1986)","journal-title":"J. ACM"},{"issue":"1","key":"364_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L Lamport","year":"1987","unstructured":"Lamport, L.: A fast mutual exclusion algorithm. ACM Trans. Comput. Syst. 5(1), 1\u201311 (1987)","journal-title":"ACM Trans. Comput. Syst."},{"key":"364_CR38","unstructured":"Magnusson, P., Landin, A., Hagersten, E.: Queue locks on cache coherent multiprocessors. In: Proceedings of the 8th international parallel processing symposium (IPPS), pp. 165\u2013171 (1994)"},{"issue":"1","key":"364_CR39","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"J Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey, J., Scott, M.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9(1), 21\u201365 (1991)","journal-title":"ACM Trans. Comput. Syst."},{"key":"364_CR40","unstructured":"Michael, M., Kim, Y.: Fault tolerant mutual exclusion locks for shared memory systems. US Patent (2009)"},{"issue":"5","key":"364_CR41","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1109\/TPDS.2015.2442980","volume":"27","author":"S Mittal","year":"2016","unstructured":"Mittal, S., Vetter, J.S.: A survey of software techniques for using non-volatile memories for storage and main memory systems. IEEE Trans. Parallel Distrib. Syst. 27(5), 1537\u20131550 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"364_CR42","unstructured":"Mogul, J.C., Argollo, E., Shah, M.A., Faraboschi, P.: Operating system support for NVM + DRAM hybrid main memory. In: Proceedings of the 12th workshop on hot topics in operating systems (HotOS) (2009)"},{"key":"364_CR43","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Oshman, R.: Resilience of mutual exclusion algorithms to transient memory faults. In: Proceedings of the 30th ACM symposium on principles of distributed computing (PODC), pp. 69\u201378 (2011)","DOI":"10.1145\/1993806.1993817"},{"key":"364_CR44","doi-asserted-by":"crossref","unstructured":"Narayanan, D., Hodson, O.: Whole-system persistence. In: Proceedings of the 17th international conference on architectural support for programming languages and operating systems (ASPLOS), pp. 401\u2013410 (2012)","DOI":"10.1145\/2150976.2151018"},{"key":"364_CR45","unstructured":"Ramaraju, A.: RGLock: Recoverable mutual exclusion for non-volatile main memory systems. Master\u2019s thesis, University of Waterloo (2015). \nhttps:\/\/uwspace.uwaterloo.ca\/handle\/10012\/9473\n\n. Accessed 31 Oct 2019"},{"key":"364_CR46","volume-title":"Algorithms for Mutual Exclusion","author":"M Raynal","year":"1986","unstructured":"Raynal, M.: Algorithms for Mutual Exclusion. MIT Press, Cambridge (1986)"},{"key":"364_CR47","doi-asserted-by":"crossref","unstructured":"Scott, M., Scherer, W.: Scalable queue-based spin locks with timeout. In: Proceedings of the 8th ACM SIGPLAN symposium on principles and practices of parallel programming (PPoPP), pp. 44\u201352 (2001)","DOI":"10.1145\/568014.379566"},{"key":"364_CR48","volume-title":"Synchronization Algorithms and Concurrent Programming","author":"G Taubenfeld","year":"2006","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming. Prentice Hall, Upper Saddle (2006)"},{"issue":"1","key":"364_CR49","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01784242","volume":"9","author":"J-H Yang","year":"1995","unstructured":"Yang, J.-H., Anderson, J.: A fast, scalable mutual exclusion algorithm. Distrib. Comput. 9(1), 51\u201360 (1995)","journal-title":"Distrib. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-019-00364-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-019-00364-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-019-00364-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T00:26:07Z","timestamp":1604449567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-019-00364-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,5]]},"references-count":49,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["364"],"URL":"https:\/\/doi.org\/10.1007\/s00446-019-00364-0","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2019,11,5]]},"assertion":[{"value":"30 September 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}