{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:37:38Z","timestamp":1725705458261},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336508"},{"type":"electronic","value":"9783642336515"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33651-5_20","type":"book-chapter","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T09:25:32Z","timestamp":1352798732000},"page":"282-296","source":"Crossref","is-referenced-by-count":0,"title":["Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks"],"prefix":"10.1007","author":[{"given":"Prasad","family":"Jayanti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00446-003-0088-6","volume":"16","author":"J.H. Anderson","year":"2003","unstructured":"Anderson, J.H., Kim, Y.-J., Herman, T.: Shared-memory mutual exclusion: major research trends since 1986. Distrib. Comput.\u00a016(2-3), 75\u2013110 (2003)","journal-title":"Distrib. Comput."},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"T.E. Anderson","year":"1990","unstructured":"Anderson, T.E.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst.\u00a01(1), 6\u201316 (1990)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"20_CR3","first-page":"468","volume-title":"PODC 2010: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing","author":"V. Bhatt","year":"2010","unstructured":"Bhatt, V., Jayanti, P.: Constant rmr solutions to reader writer synchronization. In: PODC 2010: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, pp. 468\u2013477. ACM, New York (2010)"},{"doi-asserted-by":"crossref","unstructured":"Bhatt, V., Jayanti, P.: Specification and constant rmr algorithm for phase-fair reader-writer lock. In: ICDCN 2011: Proceedings of the 12th International Conference on Distributed Computing and Networking, pp. 119\u2013130 (2011)","key":"20_CR4","DOI":"10.1007\/978-3-642-17679-1_11"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/ECRTS.2009.14","volume-title":"ECRTS 2009: Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems","author":"B.B. Brandenburg","year":"2009","unstructured":"Brandenburg, B.B., Anderson, J.H.: Reader-writer synchronization for shared-memory multiprocessor real-time systems. In: ECRTS 2009: Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems, pp. 184\u2013193. IEEE Computer Society, Washington, DC (2009)"},{"issue":"10","key":"20_CR6","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1145\/362759.362813","volume":"14","author":"P.J. Courtois","year":"1971","unstructured":"Courtois, P.J., Heymans, F., Parnas, D.L.: Concurrent control with \u201creaders\u201d and \u201cwriters\u201d. Commun. ACM\u00a014(10), 667\u2013668 (1971)","journal-title":"Commun. ACM"},{"issue":"9","key":"20_CR7","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"E.W. Dijkstra","year":"1965","unstructured":"Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM\u00a08(9), 569 (1965)","journal-title":"Commun. ACM"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1109\/SFCS.1979.37","volume-title":"SFCS 1979: Proceedings of the 20th Annual Symposium on Foundations of Computer Science","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J., Lynch, N.A., Burns, J.E., Borodin, A.: Resource allocation with immunity to limited process failure. In: SFCS 1979: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pp. 234\u2013254. IEEE Computer Society, Washington, DC (1979)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/383962.383997","volume-title":"PODC 2001: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing","author":"V. Hadzilacos","year":"2001","unstructured":"Hadzilacos, V.: A note on group mutual exclusion. In: PODC 2001: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, pp. 100\u2013106. ACM, New York (2001)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-30186-8_6","volume-title":"Distributed Computing","author":"R. Danek","year":"2004","unstructured":"Danek, R., Hadzilacos, V.: Local-Spin Group Mutual Exclusion Algorithms. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 71\u201385. Springer, Heidelberg (2004)"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/872035.872079","volume-title":"PODC 2003: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing","author":"P. Jayanti","year":"2003","unstructured":"Jayanti, P.: Adaptive and efficient abortable mutual exclusion. In: PODC 2003: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, pp. 295\u2013304. ACM, New York (2003)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/277697.277706","volume-title":"PODC 1998: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing","author":"Y.-J. Joung","year":"1998","unstructured":"Joung, Y.-J.: Asynchronous group mutual exclusion (extended abstract). In: PODC 1998: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 51\u201360. ACM, New York (1998)"},{"issue":"8","key":"20_CR13","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\u00a017(8), 453\u2013455 (1974)","journal-title":"Commun. ACM"},{"key":"20_CR14","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.\u00a06490, pp. 364\u2013379. Springer, Heidelberg (2010)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1583991.1584020","volume-title":"SPAA 2009: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures","author":"Y. Lev","year":"2009","unstructured":"Lev, Y., Luchangco, V., Olszewski, M.: Scalable reader-writer locks. In: SPAA 2009: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, pp. 101\u2013110. ACM, New York (2009)"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"J.M. Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey, J.M., Scott, M.L.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst.\u00a09(1), 21\u201365 (1991)","journal-title":"ACM Trans. Comput. Syst."},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/109625.109637","volume-title":"PPOPP 1991: Proceedings of the Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","author":"J.M. Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey, J.M., Scott, M.L.: Scalable reader-writer synchronization for shared-memory multiprocessors. In: PPOPP 1991: Proceedings of the Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 106\u2013113. ACM, New York (1991)"},{"doi-asserted-by":"crossref","unstructured":"Scott, M.L.: Non-blocking timeout in scalable queue-based spin locks. In: Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, pp. 31\u201340 (2002)","key":"20_CR18","DOI":"10.1145\/571825.571830"},{"doi-asserted-by":"crossref","unstructured":"Scott, M.L., Scherer III, W.N.: Scalable queue-based spin locks with timeout. In: Proceedings of the 8th Symposium on Principles and Practice of Parallel Programming, pp. 44\u201352 (2001)","key":"20_CR19","DOI":"10.1145\/568014.379566"},{"unstructured":"Zheng, N.: Constant-rmr abortable reader-priority reader-writer algorithm. Technical Report TR2011-685, Dartmouth College, Computer Science, Hanover, NH (June 2011)","key":"20_CR20"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33651-5_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:17:31Z","timestamp":1620130651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33651-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336508","9783642336515"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33651-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}