{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:36:32Z","timestamp":1753601792996,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031174353"},{"type":"electronic","value":"9783031174360"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17436-0_3","type":"book-chapter","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T14:19:41Z","timestamp":1664288381000},"page":"31-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recycling Memory in\u00a0Recoverable Mutex Locks"],"prefix":"10.1007","author":[{"given":"Aravind","family":"Segu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Golab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"TE Anderson","year":"1990","unstructured":"Anderson, T.E.: 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":"3_CR2","doi-asserted-by":"crossref","unstructured":"Chan, D., Woelfel, P.: A tight lower bound for the RMR complexity of recoverable mutual exclusion. In: Proceedings of the 40th ACM Symposium on Principles of Distributed Computing (PODC), pp. 533\u2013543 (2021)","DOI":"10.1145\/3465084.3467938"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Chan, D.Y.C., Woelfel, P.: Recoverable mutual exclusion with constant amortized RMR complexity from standard primitives. In: Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC), pp. 181\u2013190 (2020)","DOI":"10.1145\/3382734.3405736"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"David, T., Guerraoui, R., Trigonakis, V.: Everything you always wanted to know about synchronization but were afraid to ask. In: Proceedings of the 25th ACM Symposium on Operating System Principles (SOSP), pp. 33\u201348 (2013)","DOI":"10.1145\/2517349.2522714"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Dhoked, S., Mittal, N.: An adaptive approach to recoverable mutual exclusion. In: Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC), pp. 1\u201310 (2020)","DOI":"10.1145\/3382734.3405739"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Dhoked, S., Mittal, N.: An adaptive approach to recoverable mutual exclusion. CoRR abs\/2006.07086 (2020). https:\/\/arxiv.org\/abs\/2006.07086","DOI":"10.1145\/3382734.3405739"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/357980.357989","volume":"26","author":"EW Dijkstra","year":"1983","unstructured":"Dijkstra, E.W.: Solutions of a problem in concurrent programming control (reprint). Commun. ACM 26(1), 21\u201322 (1983)","journal-title":"Commun. ACM"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Golab, W., Hendler, D.: Recoverable mutual exclusion in sub-logarithmic time. In: Proceedings of the 36th ACM Symposium on Principles of Distributed Computing (PODC), pp. 211\u2013220 (2017)","DOI":"10.1145\/3087801.3087819"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Golab, W., Hendler, D.: Recoverable mutual exclusion under system-wide failures. In: Proceedings of the 37th ACM Symposium on Principles of Distributed Computing (PODC), pp. 17\u201326 (2018)","DOI":"10.1145\/3212734.3212755"},{"key":"3_CR10","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":"3_CR11","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00446-019-00364-0","volume":"32","author":"W Golab","year":"2019","unstructured":"Golab, W., Ramaraju, A.: Recoverable mutual exclusion. Distrib. Comput. 32(6), 535\u2013564 (2019). https:\/\/doi.org\/10.1007\/s00446-019-00364-0","journal-title":"Distrib. Comput."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-05529-5_13","volume-title":"Networked Systems","author":"P Jayanti","year":"2019","unstructured":"Jayanti, P., Jayanti, S., Joshi, A.: Optimal recoverable mutual exclusion using only FASAS. In: Podelski, A., Ta\u00efani, F. (eds.) NETYS 2018. LNCS, vol. 11028, pp. 191\u2013206. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05529-5_13"},{"key":"3_CR13","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 ACM Symposium on Principles of Distributed Computing (PODC), pp. 177\u2013186 (2019)","DOI":"10.1145\/3293611.3331634"},{"key":"3_CR14","unstructured":"Jayanti, P., Joshi, A.: Recoverable FCFS mutual exclusion with wait-free recovery. In: Proceedings of the 31th International Symposium on Distributed Computing (DISC), pp. 30:1\u201330:15 (2017)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Joshi, A.: Recoverable mutual exclusion with abortability. In: Proceedings of the 7th International Conference on Networked Systems (NETYS), pp. 217\u2013232 (2019)","DOI":"10.1007\/978-3-030-31277-0_14"},{"key":"3_CR16","unstructured":"Katzan, D., Morrison, A.: Recoverable, abortable, and adaptive mutual exclusion with sublogarithmic RMR complexity. In: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), pp. 15:1\u201315:16 (2021)"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"JM Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey, J.M., Scott, M.L.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9(1), 21\u201365 (1991)","journal-title":"ACM Trans. Comput. Syst."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Xiao, J., Zhang, Z., Golab, W.: Benchmarking recoverable mutex locks. In: Proceedings of the 32nd ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 583\u2013585 (2020)","DOI":"10.1145\/3350755.3400269"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17436-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T14:20:09Z","timestamp":1664288409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17436-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031174353","9783031174360"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17436-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}