{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T20:28:25Z","timestamp":1686083305262},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,3,19]],"date-time":"2010-03-19T00:00:00Z","timestamp":1268956800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s00446-010-0096-2","type":"journal-article","created":{"date-parts":[[2010,3,18]],"date-time":"2010-03-18T12:06:59Z","timestamp":1268914019000},"page":"87-111","source":"Crossref","is-referenced-by-count":11,"title":["Closing the complexity gap between FCFS mutual exclusion and mutual exclusion"],"prefix":"10.1007","volume":"23","author":[{"given":"Robert","family":"Danek","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":[[2010,3,19]]},"reference":[{"issue":"9","key":"96_CR1","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"E. Dijkstra","year":"1965","unstructured":"Dijkstra E.: Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)","journal-title":"Commun. ACM"},{"issue":"8","key":"96_CR2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport L.: A new solution to Dijkstra\u2019s concurrent programming problem. Commun. ACM 17(8), 453\u2013455 (1974)","journal-title":"Commun. ACM"},{"issue":"1","key":"96_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"J. Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey J., 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."},{"issue":"1","key":"96_CR4","doi-asserted-by":"crossref","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":"96_CR5","doi-asserted-by":"crossref","unstructured":"Kim, Y.J., Anderson, J.: A time complexity bound for adaptive mutual exclusion. In: Proceedings of DISC \u201901, pp. 1\u201315 (2008)","DOI":"10.1007\/3-540-45414-4_1"},{"key":"96_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 STOC\u201908, pp. 217\u2013226 (2008)","DOI":"10.1145\/1374376.1374410"},{"key":"96_CR7","doi-asserted-by":"crossref","unstructured":"Golab, W., Hadzilacos, V., Hendler, D., Woelfel, P.: Constant-RMR implementations of CAS and other synchronization primitives using read and write operations. In: Proceedings of PODC \u201907, New York, NY, USA, ACM, pp. 3\u201312 (2007)","DOI":"10.1145\/1281100.1281105"},{"issue":"1","key":"96_CR8","doi-asserted-by":"crossref","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":"96_CR9","doi-asserted-by":"crossref","unstructured":"Styer, E.: Improving fast mutual exclusion. In: PODC \u201992: Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, New York, NY, USA, ACM, pp. 159\u2013168 (1992)","DOI":"10.1145\/135419.135453"},{"issue":"1","key":"96_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02283567","volume":"8","author":"M. Choy","year":"1994","unstructured":"Choy M., Singh A.K.: Adaptive solutions to the mutual exclusion problem. Distrib. Comput. 8(1), 1\u201317 (1994)","journal-title":"Distrib. Comput."},{"issue":"3","key":"96_CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s004460100068","volume":"15","author":"H. Attiya","year":"2002","unstructured":"Attiya H., Bortnikov V.: Adaptive and efficient mutual exclusion. Distrib. Comput. 15(3), 177\u2013189 (2002)","journal-title":"Distrib. Comput."},{"issue":"1","key":"96_CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01784242","volume":"9","author":"J.H. Yang","year":"1995","unstructured":"Yang J.H., Anderson J.H.: A fast, scalable mutual exclusion algorithm. Distrib. Comput. 9(1), 51\u201360 (1995)","journal-title":"Distrib. Comput."},{"issue":"3","key":"96_CR13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s00446-006-0009-6","volume":"19","author":"Y.J. Kim","year":"2007","unstructured":"Kim Y.J., Anderson J.: Adaptive mutual exclusion with local spinning. Distrib. Comput. 19(3), 197\u2013236 (2007)","journal-title":"Distrib. Comput."},{"issue":"2","key":"96_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s004460100060","volume":"15","author":"Y. Afek","year":"2002","unstructured":"Afek Y., Stupp G., Touitou D.: Long lived adaptive splitter and applications. Distrib. Comput. 15(2), 67\u201386 (2002)","journal-title":"Distrib. Comput."},{"key":"96_CR15","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: f-arrays: Implementation and applications. In: PODC \u201902: Proceedings of the Twenty-first Annual Symposium on Principles of Distributed Computing, New York, NY, USA, ACM, pp. 270\u2013279 (2002)","DOI":"10.1145\/571825.571875"},{"key":"96_CR16","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: The black-white bakery algorithm and related bounded-space, adaptive, local-spinning and fifo algorithms. In: DISC, pp. 56\u201370 (2004)","DOI":"10.1007\/978-3-540-30186-8_5"},{"key":"96_CR17","doi-asserted-by":"crossref","unstructured":"Cypher, R.: The communication requirements of mutual exclusion. In: SPAA \u201995: Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, New York, NY, USA, ACM Press, pp. 147\u2013156 (1995)","DOI":"10.1145\/215399.215434"},{"issue":"4","key":"96_CR18","doi-asserted-by":"crossref","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."},{"key":"96_CR19","doi-asserted-by":"crossref","unstructured":"Fan, R., Lynch, N.: An \u03a9(n log n) lower bound on the cost of mutual exclusion. In: PODC \u201906: Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing, New York, NY, USA, ACM Press, pp. 275\u2013284 (2006)","DOI":"10.1145\/1146381.1146423"},{"issue":"3","key":"96_CR20","first-page":"219","volume":"2","author":"N. Lynch","year":"1989","unstructured":"Lynch N., Tuttle M.: An introduction to input\/output automata. CWI-Q. 2(3), 219\u2013246 (1989)","journal-title":"CWI-Q."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0096-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-010-0096-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0096-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:26:43Z","timestamp":1559122003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-010-0096-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,19]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["96"],"URL":"https:\/\/doi.org\/10.1007\/s00446-010-0096-2","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,19]]}}}