{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:52:56Z","timestamp":1753602776880},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030312763"},{"type":"electronic","value":"9783030312770"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31277-0_14","type":"book-chapter","created":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T08:02:53Z","timestamp":1568361773000},"page":"217-232","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Recoverable Mutual Exclusion with Abortability"],"prefix":"10.1007","author":[{"given":"Prasad","family":"Jayanti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anup","family":"Joshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,14]]},"reference":[{"issue":"4\/5","key":"14_CR1","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1147\/rd.524.0465","volume":"52","author":"S Raoux","year":"2008","unstructured":"Raoux, S., et al.: Phase-change random access memory: a scalable technology. IBM J. Res. Dev. 52(4\/5), 465 (2008)","journal-title":"IBM J. Res. Dev."},{"issue":"7191","key":"14_CR2","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1038\/nature06932","volume":"453","author":"DB Strukov","year":"2008","unstructured":"Strukov, D.B., Snider, G.S., Stewart, D.R., Williams, R.S.: The missing memristor found. Nature 453(7191), 80 (2008)","journal-title":"Nature"},{"issue":"5","key":"14_CR3","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1109\/JPROC.2003.811804","volume":"91","author":"S Tehrani","year":"2003","unstructured":"Tehrani, S., et al.: Magnetoresistive random access memory using magnetic tunnel junctions. Proce. IEEE 91(5), 703\u2013714 (2003)","journal-title":"Proce. IEEE"},{"issue":"9","key":"14_CR4","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"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Golab, W., Ramaraju, A.: Recoverable mutual exclusion: [extended abstract]. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, pp. 65\u201374. ACM, New York (2016)","DOI":"10.1145\/2933057.2933087"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Golab, W., Hendler, D.: Recoverable mutual exclusion in sub-logarithmic time. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, pp. 211\u2013220. ACM, New York (2017)","DOI":"10.1145\/3087801.3087819"},{"key":"14_CR7","unstructured":"Jayanti, P., Joshi, A.: Recoverable FCFS mutual exclusion with wait-free recovery. In: 31st International Symposium on Distributed Computing, DISC 2017, pp. 30:1\u201330:15 (2017)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Golab, W., Hendler, D.: Recoverable mutual exclusion under system-wide failures. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, pp. 17\u201326. ACM, New York (2018)","DOI":"10.1145\/3212734.3212755"},{"key":"14_CR9","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). \n                      https:\/\/doi.org\/10.1007\/978-3-030-05529-5_13"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Jayanti, S., Joshi, A.: Recoverable Mutual Exclusion with Sub-logarithmic RMR Complexity on CC and DSM machines. In: Accepted for publication in PODC 2019 (2019)","DOI":"10.1145\/3293611.3331634"},{"key":"14_CR11","unstructured":"Ramaraju, A.: RGLock: recoverable mutual exclusion for non-volatile main memory systems. Master\u2019s thesis, University of Waterloo (2015)"},{"issue":"8","key":"14_CR12","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"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Attiya, H., Ben-Baruch, O., Hendler, D.: Nesting-safe recoverable linearizability: modular constructions for non-volatile memory. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pp. 7\u201316. ACM (2018)","DOI":"10.1145\/3212734.3212753"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Scott, M.L.: Non-blocking timeout in scalable queue-based spin locks. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, PODC 2002, pp. 31\u201340. ACM, New York (2002)","DOI":"10.1145\/571825.571830"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Scott, M.L., Scherer, W.N.: Scalable queue-based spin locks with timeout. In: Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, PPoPP 2001, pp. 44\u201352. ACM, New York (2001)","DOI":"10.1145\/568014.379566"},{"issue":"1","key":"14_CR16","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":"14_CR17","unstructured":"Craig, T.S.: Building FIFO and priority-queuing spin locks from atomic swap. Technical report TR-93-02-02, Department of Computer Science, University of Washington, February 1993"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: Adaptive and efficient abortable mutual exclusion. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, PODC 2003, pp. 295\u2013304. ACM, New York (2003)","DOI":"10.1145\/872035.872079"},{"key":"14_CR19","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 Fortieth ACM Symposium on Theory of Computing, STOC 2008, pp. 217\u2013226. ACM, New York (2008)","DOI":"10.1145\/1374376.1374410"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-17653-1_27","volume-title":"Principles of Distributed Systems","author":"H Lee","year":"2010","unstructured":"Lee, H.: Fast local-spin abortable mutual exclusion with bounded space. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 364\u2013379. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-17653-1_27"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Alon, A., Morrison, A.: Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, pp. 27\u201336. ACM, New York (2018)","DOI":"10.1145\/3212734.3212759"},{"key":"14_CR22","unstructured":"Jayanti, P., Jayanti, S.V.: Constant amortized RMR complexity deterministic abortable mutual exclusion algorithm for CC and DSM models. In: Accepted for publication in PODC 2019 (2019)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-33651-5_19","volume-title":"Distributed Computing","author":"A Pareek","year":"2012","unstructured":"Pareek, A., Woelfel, P.: RMR-efficient randomized abortable mutual exclusion. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 267\u2013281. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-33651-5_19"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Woelfel, P.: Randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, pp. 221\u2013229. ACM, New York (2017)","DOI":"10.1145\/3087801.3087837"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: \n                      \n                        \n                      \n                      $$f$$\n                    -arrays: implementation and applications. In: Proceedings of the Twenty-First Symposium on Principles of Distributed Computing, PODC 2002, pp. 270\u2013279. ACM, New York (2002)","DOI":"10.1145\/571873.571875"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31277-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T08:06:40Z","timestamp":1568362000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31277-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030312763","9783030312770"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31277-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 September 2019","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":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2019","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":"60","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":"23","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":"4","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":"38% - 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":"2.91","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.68","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)"}}]}}