{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:31:43Z","timestamp":1736400703894,"version":"3.32.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T00:00:00Z","timestamp":1146700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T00:00:00Z","timestamp":1146700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s00446-006-0003-z","type":"journal-article","created":{"date-parts":[[2006,5,3]],"date-time":"2006-05-03T15:03:03Z","timestamp":1146668583000},"page":"19-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Nonatomic 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":"J. H.","family":"Aderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,4]]},"reference":[{"key":"3_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":"3_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Boxer, P., Touitou, D.: Bounds on the shared memory requirements for long-lived and adaptive objects. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 81\u201389. ACM (2000)","DOI":"10.1145\/343477.343523"},{"key":"3_CR3","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":"3_CR4","doi-asserted-by":"publisher","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. Distributed Comput. 15(2), 67\u201386 (2002)","journal-title":"Distributed Comput."},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1006\/inco.1996.0034","volume":"126","author":"R. Alur","year":"1996","unstructured":"Alur, R., Taubenfeld, G.: Contention-free complexity of shared memory algorithms. Inf. Comput. 126(1),62\u201373 (1996)","journal-title":"Inf. Comput."},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01179373","volume":"30","author":"J. Anderson","year":"1993","unstructured":"Anderson, J.: A fine-grained solution to the mutual exclusion problem. Acta Informatica 30(3), 249\u2013265 (1993)","journal-title":"Acta Informatica"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0190(88)90171-8","volume":"28","author":"J. Anderson","year":"1988","unstructured":"Anderson, J., Gouda, M.: Atomic semantics of nonatomic programs. Inf. Process. Lett. 28(2), 99\u2013103 (1988)","journal-title":"Inf. Process. Lett."},{"key":"3_CR8","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 1914, Springer-Verlag (2000)","DOI":"10.1007\/3-540-40026-5_2"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/PL00008923","volume":"14","author":"J. Anderson","year":"2001","unstructured":"Anderson, J., Kim, Y.J.: A new fast-path mechanism for mutual exclusion. Distributed Comput. 14(1), 17\u201329 (2001)","journal-title":"Distributed Comput."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Anderson, J., Kim, Y.J.: Nonatomic mutual exclusion with local spinning. In: Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing, pp. 3\u201312. ACM (2002)","DOI":"10.1145\/571825.571827"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00446-002-0084-2","volume":"15","author":"J. Anderson","year":"2003","unstructured":"Anderson, J., Kim, Y.J.: An improved lower bound for the time complexity of mutual exclusion. Distributed Comput. 15(4), 221\u2013253 (2003)","journal-title":"Distributed Comput."},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1006\/inco.1996.0006","volume":"124","author":"J. Anderson","year":"1996","unstructured":"Anderson, J., Yang, J.H.: Time\/contention tradeoffs for multiprocessor synchronization. Inf. Comput. 124(1), 68\u201384 (1996)","journal-title":"Inf. Comput."},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","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 and Distributed Syst. 1(1), 6\u201316 (1990)","journal-title":"IEEE Trans. Parallel and Distributed Syst."},{"key":"3_CR14","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":"3_CR15","unstructured":"Burns, J., Lynch, N.: Mutual exclusion using indivisible reads and writes. In: Proceedings of the 18th Annual Allerton Conference on Communication, Control, and Computing, pp. 833\u2013842 (1980)"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02283567","volume":"8","author":"M. Choy","year":"1994","unstructured":"Choy, M., Singh, A.: Adaptive solutions to the mutual exclusion problem. Distributed Comput. 8(1), 1\u201317 (1994)","journal-title":"Distributed Comput."},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/2.55501","volume":"23","author":"G. Graunke","year":"1990","unstructured":"Graunke, G., Thakkar, S.: Synchronization algorithms for shared-memory multiprocessors. IEEE Comput. 23, 60\u201369 (1990)","journal-title":"IEEE Comput."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Haldar, S., Subramanian, P.: Space-optimum conflict-free construction of 1-writer 1-reader multivalued atomic variable. In: Proceedings of the Eighth International Workshop on Distributed Algorithms, pp. 116\u2013129. Lecture Notes in Computer Science 857, Springer-Verlag (1994)","DOI":"10.1007\/BFb0020428"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1145\/200836.200871","volume":"42","author":"S. Haldar","year":"1995","unstructured":"Haldar, S., Vidyasankar, K.: Constructing 1-writer multireader multivalued atomic variables from regular variables. J. ACM 42(1), 186\u2013203 (1995)","journal-title":"J. ACM"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF00288966","volume":"17","author":"J. Kessels","year":"1982","unstructured":"Kessels, J.: Arbitration without common modifiable variables. Acta Informatica 17, 135\u2013141 (1982)","journal-title":"Acta Informatica"},{"key":"3_CR21","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 2180, Springer-Verlag (2001)","DOI":"10.1007\/3-540-45414-4_1"},{"issue":"8","key":"3_CR22","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's concurrent programming problem. Commun. ACM 17(8), 453\u2013455 (1974)","journal-title":"Commun. ACM"},{"issue":"2","key":"3_CR23","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1145\/5383.5385","volume":"33","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: {Part II\u2013-Statement} and solutions. J. ACM 33(2), 327\u2013348 (1986)","journal-title":"J. ACM"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication: Part II\u2013-Algorithms. Distributed Comput. 1, 86\u2013101 (1986)","journal-title":"Distributed Comput."},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","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."},{"issue":"3","key":"3_CR26","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/78969.78970","volume":"12","author":"L. Lamport","year":"1990","unstructured":"Lamport, L.: win and sin: Predicate transformers for concurrency. ACM Trans. Programming Languages and Syst. 12(3), 396\u2013428 (1990)","journal-title":"ACM Trans. Programming Languages and Syst."},{"issue":"1","key":"3_CR27","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"J. Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey, J., Scott, M.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9(1), 21\u201365 (1991)","journal-title":"ACM Trans. Comput. Syst."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Peterson, G., Burns, J.: Concurrent reading while writing {II}: The multi-writer case. In: Proceedings of the 28th Annual ACM Symposium on the Foundation of Computer Science. ACM (1987)","DOI":"10.1109\/SFCS.1987.15"},{"key":"3_CR29","unstructured":"Schaffer, R.: On the correctness of atomic multi-writer registers. Tech. Rep. MIT\/LCS\/TM-364, Laboratory for Computer Science, MIT, Cambridge (1988)"},{"issue":"2","key":"3_CR30","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1145\/174652.174657","volume":"41","author":"A. Singh","year":"1994","unstructured":"Singh, A., Anderson, J., Gouda, M.: The elusive atomic register. J. ACM 41(2), 311\u2013339 (1994)","journal-title":"J. ACM"},{"key":"3_CR31","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"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Styer, E., Peterson, G.: Tight bounds for shared memory symmetric mutual exclusion. In: Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pp. 177\u2013191. ACM (1989)","DOI":"10.1145\/72981.72993"},{"key":"3_CR33","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"issue":"1","key":"3_CR34","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01784242","volume":"9","author":"J.H. Yang","year":"1995","unstructured":"Yang, J.H., Anderson, J.: A fast, scalable mutual exclusion algorithm. Distributed Comput. 9(1), 51\u201360 (1995)","journal-title":"Distributed Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0003-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-006-0003-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0003-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0003-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T20:11:17Z","timestamp":1736367077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-006-0003-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,4]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["3"],"URL":"https:\/\/doi.org\/10.1007\/s00446-006-0003-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2006,5,4]]},"assertion":[{"value":"7 July 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}