{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T05:08:37Z","timestamp":1714799317488},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T00:00:00Z","timestamp":1160438400000},"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":[[2006,11,23]]},"DOI":"10.1007\/s00446-006-0009-6","type":"journal-article","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T15:22:56Z","timestamp":1160407376000},"page":"197-236","source":"Crossref","is-referenced-by-count":9,"title":["Adaptive mutual exclusion with local spinning"],"prefix":"10.1007","volume":"19","author":[{"given":"Yong-Jik","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James H.","family":"Anderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,10]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-lived renaming made adaptive. In: Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pp. 91\u2013103. ACM (1999)","DOI":"10.1145\/301308.301335"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science. pp. 262\u2013272. IEEE (1999)","DOI":"10.1109\/SFFCS.1999.814598"},{"issue":"2","key":"9_CR3","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. (2002). Long-lived adaptive splitter and applications. Distrib. Comput. 15(2):67\u201386","journal-title":"Distrib. Comput."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Taubenfeld, G.: Results about fast mutual exclusion. In: Proceedings of the 13th IEEE Real-time Systems Symposium. pp. 12\u201321. IEEE (1992)","DOI":"10.1109\/REAL.1992.242680"},{"issue":"3","key":"9_CR5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01179373","volume":"30","author":"J. Anderson","year":"1993","unstructured":"Anderson J. (1993). A fine-grained solution to the mutual exclusion problem. Acta Inform. 30(3):249\u2013265","journal-title":"Acta Inform."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Anderson, J., Kim, Y.-J.: Adaptive mutual exclusion with local spinning. In: Proceedings of the 14th International Symposium on Distributed Computing, pp. 29\u201343. Lecture Notes in Computer Science vol. 1914. Springer, Berlin Heidelberg New York (2000)","DOI":"10.1007\/3-540-40026-5_2"},{"issue":"1","key":"9_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/PL00008923","volume":"14","author":"J. Anderson","year":"2001","unstructured":"Anderson J., Kim Y.-J. (2001). A new fast-path mechanism for mutual exclusion. Distrib. Comput. 14(1):17\u201329","journal-title":"Distrib. Comput."},{"issue":"4","key":"9_CR8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s00446-002-0084-2","volume":"15","author":"J. Anderson","year":"2003","unstructured":"Anderson J., Kim Y.-J. (2003). An improved lower bound for the time complexity of mutual exclusion. Distrib. Comput. 15(4):221\u2013253","journal-title":"Distrib. Comput."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Anderson, J., Moir, M.: Universal constructions for multi-object operations. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pp. 184\u2013193. ACM (1995)","DOI":"10.1145\/224964.224985"},{"issue":"1","key":"9_CR10","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"T. Anderson","year":"1990","unstructured":"Anderson T. (1990). The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst. 1(1):6\u201316","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Attiya, H., Bortnikov, V.: Adaptive and efficient mutual exclusion. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 91\u2013100. ACM (2000)","DOI":"10.1145\/343477.343525"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Attiya, H., Fouren, A.: Adaptive wait-free algorithms for lattice agreement and renaming. In: Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pp. 277\u2013286. ACM (1998)","DOI":"10.1145\/277697.277749"},{"issue":"1","key":"9_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02283567","volume":"8","author":"M. Choy","year":"1994","unstructured":"Choy M., Singh A. (1994). Adaptive solutions to the mutual exclusion problem. Distrib. Comput. 8(1):1\u201317","journal-title":"Distrib. Comput."},{"issue":"9","key":"9_CR14","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"E. Dijkstra","year":"1965","unstructured":"Dijkstra E. (1965). Solution of a problem in concurrent programming control. Commun ACM 8(9):569","journal-title":"Commun ACM"},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/2.55501","volume":"23","author":"G. Graunke","year":"1990","unstructured":"Graunke G., Thakkar S. (1990). Synchronization algorithms for shared-memory multiprocessors. IEEE Comput. 23:60\u201369","journal-title":"IEEE Comput."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Kim, Y.-J., Anderson, J.: A time complexity bound for adaptive mutual exclusion. In: Proceedings of the 15th International Symposium on Distributed Computing, pp. 1\u201315. Lecture Notes in Computer Science, vol. 2180, Springer, Berlin Heidelberg New York (2001)","DOI":"10.1007\/3-540-45414-4_1"},{"issue":"1","key":"9_CR17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0020-0190(02)00224-7","volume":"84","author":"Y.-J. Kim","year":"2002","unstructured":"Kim Y.-J., Anderson J. (2002). A space- and time-efficient local-spin spin lock. Inf. Process. Lett. 84(1):47\u201355","journal-title":"Inf. Process. Lett."},{"issue":"8","key":"9_CR18","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport L. (1974). A new solution of Dijkstra\u2019s concurrent programming problem. Commun. ACM 17(8):453\u2013455","journal-title":"Commun. ACM"},{"issue":"1","key":"9_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"Lamport L. (1987). A fast mutual exclusion algorithm. ACM Trans. Comput. Syst. 5(1):1\u201311","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"9_CR20","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. (1991). Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9(1):21\u201365","journal-title":"ACM Trans. Comput. Syst."},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0020-0190(93)90015-2","volume":"45","author":"M. Merritt","year":"1993","unstructured":"Merritt M., Taubenfeld G. (1993). Speeding Lamport\u2019s fast mutual exclusion algorithm. Inf. Process. Lett. 45:137\u2013142","journal-title":"Inf. Process. Lett."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Merritt, M., Taubenfeld, G.: Computing with infinitely many processes. In: Proceedings of the 14th International Symposium on Distributed Computing, pp. 164\u2013178. Lecture Notes in Computer Science vol. 1914. Springer, Berlin Heidelberg New York (2000)","DOI":"10.1007\/3-540-40026-5_11"},{"issue":"1","key":"9_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(95)00009-H","volume":"25","author":"M. Moir","year":"1995","unstructured":"Moir M., Anderson J. (1995). Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Program. 25(1):1\u201339","journal-title":"Sci. Comput. Program."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Styer,, E.: Improving fast mutual exclusion. In: Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pp. 159\u2013168. ACM (1992)","DOI":"10.1145\/135419.135453"},{"issue":"1","key":"9_CR25","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. (1995). A fast, scalable mutual exclusion algorithm. Distrib. Comput. 9(1):51\u201360","journal-title":"Distrib. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0009-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-006-0009-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0009-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:36Z","timestamp":1559136396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-006-0009-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,10]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,11,23]]}},"alternative-id":["9"],"URL":"https:\/\/doi.org\/10.1007\/s00446-006-0009-6","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,10]]}}}