{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:37Z","timestamp":1725574117850},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176784"},{"type":"electronic","value":"9783642176791"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-17679-1_11","type":"book-chapter","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T18:44:30Z","timestamp":1294253070000},"page":"119-130","source":"Crossref","is-referenced-by-count":4,"title":["Specification and Constant RMR Algorithm for Phase-Fair Reader-Writer Lock"],"prefix":"10.1007","author":[{"given":"Vibhor","family":"Bhatt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasad","family":"Jayanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","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, Washington, DC, USA, pp. 184\u2013193. IEEE Computer Society, Los Alamitos (2009)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Brandenburg, B.B., Anderson, J.H.: Spin-based reader-writer synchronization for multiprocessor real-time systems. Submitted to the Real-Time Systems (December 2009), http:\/\/www.cs.unc.edu\/~anderson\/papers\/rtj09-for-web.pdf","DOI":"10.1109\/ECRTS.2009.14"},{"issue":"9","key":"11_CR3","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"},{"issue":"10","key":"11_CR4","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"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1145\/1835698.1835803","volume-title":"PODC 2010: Proceeding of the 29th ACM SIGACT-SIGOPS 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: Proceeding of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 468\u2013477. ACM, New York (2010)"},{"issue":"8","key":"11_CR6","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":"11_CR7","first-page":"106","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)"},{"key":"11_CR8","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)"},{"key":"11_CR9","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":"V. Hadzilacos","year":"2004","unstructured":"Hadzilacos, V., Danek, R.: Local-spin group mutual exclusion algorithms. In: Liu, H. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 71\u201385. Springer, Heidelberg (2004)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/215399.215434","volume-title":"SPAA 1995: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures","author":"R. Cypher","year":"1995","unstructured":"Cypher, R.: The communication requirements of mutual exclusion. In: SPAA 1995: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 147\u2013156. ACM, New York (1995)"},{"key":"11_CR11","first-page":"217","volume-title":"STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"H. Attiya","year":"2008","unstructured":"Attiya, H., Hendler, D., Woelfel, P.: Tight RMR lower bounds for mutual exclusion and other problems. In: STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 217\u2013226. ACM, New York (2008)"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00446-002-0084-2","volume":"15","author":"J.H. Anderson","year":"2002","unstructured":"Anderson, J.H., Kim, Y.-J.: An improved lower bound for the time complexity of mutual exclusion. Distrib. Comput.\u00a015(4), 221\u2013253 (2002)","journal-title":"Distrib. Comput."},{"issue":"1","key":"11_CR13","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."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17679-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T16:09:10Z","timestamp":1559923750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17679-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642176784","9783642176791"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17679-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}