{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:16:08Z","timestamp":1725574568215},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201847"},{"type":"electronic","value":"9783540399896"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39989-6_3","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T02:01:57Z","timestamp":1294452117000},"page":"30-44","source":"Crossref","is-referenced-by-count":5,"title":["Timing-Based Mutual Exclusion with Local Spinning"],"prefix":"10.1007","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","reference":[{"key":"3_CR1","first-page":"81","volume-title":"Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing","author":"Y. Afek","year":"2000","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, July 2000, pp. 81\u201389. ACM, New York (2000)"},{"key":"3_CR2","first-page":"800","volume-title":"Proceedings of the 26th Annual ACM Symposium on Theory of Computing","author":"R. Alur","year":"1994","unstructured":"Alur, R., Attiya, H., Taubenfeld, G.: Time-adaptive algorithms for synchronization. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, May 1994, pp. 800\u2013809. ACM, New York (1994)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1109\/SPDP.1993.395496","volume-title":"Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing","author":"R. Alur","year":"1993","unstructured":"Alur, R., Taubenfeld, G.: How to share an object: A fast timing-based solution. In: Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing, pp. 470\u2013477. IEEE, Los Alamitos (1993)"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s004460050020","volume":"10","author":"R. Alur","year":"1996","unstructured":"Alur, R., Taubenfeld, G.: Fast timing-based algorithms. Distributed Computing\u00a010(1), 1\u201310 (1996)","journal-title":"Distributed Computing"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/383962.383996","volume-title":"Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing","author":"J. Anderson","year":"2001","unstructured":"Anderson, J., Kim, Y.-J.: An improved lower bound for the time complexity of mutual exclusion. In: Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, August 2001, pp. 90\u201399. ACM, New York (2001)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/ICDCS.2003.1203505","volume-title":"Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems","author":"J. Anderson","year":"2003","unstructured":"Anderson, J., Kim, Y.-J.: Local-spin mutual exclusion using fetch-and-\u03c6 primitives. In: Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems, May 2003, pp. 538\u2013547. IEEE, Los Alamitos (2003)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Anderson, J., Kim, Y.-J., Herman, T.: Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing (2003) (to appear)","DOI":"10.1007\/s00446-003-0088-6"},{"issue":"l","key":"3_CR8","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. Information and Computation\u00a0124(l), 68\u201384 (1996)","journal-title":"Information and Computation"},{"issue":"1","key":"3_CR9","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 Transactions on Parallel and Distributed Systems\u00a01(1), 6\u201316 (1990)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"3_CR10","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)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Cypher, R.: The communication requirements of mutual exclusion. In: Proceedings of the Seventh Annual Symposium on Parallel Algorithms and Architectures, June 1995, pp. 147\u2013156 (1995)","DOI":"10.1145\/215399.215434"},{"key":"3_CR12","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 Computer\u00a023, 60\u201369 (1990)","journal-title":"IEEE Computer"},{"key":"3_CR13","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\u00a017, 135\u2013141 (1982)","journal-title":"Acta Informatica"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Kim, Y.-J., Anderson, J.: Timing-based mutual exclusion with local spinning. Manuscript (July 2003), Available from http: http:\/\/www.cs.unc.edu\/~anderson\/papers.html","DOI":"10.1007\/978-3-540-39989-6_3"},{"key":"3_CR15","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 (October 2001)","DOI":"10.1007\/3-540-45414-4_1"},{"issue":"1","key":"3_CR16","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 Transactions on Computer Systems\u00a05(1), 1\u201311 (1987)","journal-title":"ACM Transactions on Computer Systems"},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/REAL.1992.242681","volume-title":"Proceedings of the 13th IEEE Real-Time Systems Symposium","author":"N. Lynch","year":"1992","unstructured":"Lynch, N., Shavit, N.: Timing based mutual exclusion. In: Proceedings of the 13th IEEE Real-Time Systems Symposium, December 1992, pp. 2\u201311. IEEE, Los Alamitos (1992)"},{"issue":"1","key":"3_CR18","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 Transactions on Computer Systems\u00a09(1), 21\u201365 (1991)","journal-title":"ACM Transactions on Computer Systems"},{"key":"3_CR19","first-page":"233","volume-title":"Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing","author":"S. Ramamurthy","year":"1996","unstructured":"Ramamurthy, S., Moir, M., Anderson, J.: Real-time object sharing with minimal support. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, May 1996, pp. 233\u2013242. ACM, New York (1996)"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/72981.72993","volume-title":"Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing","author":"E. Styer","year":"1989","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, August 1989, pp. 177\u2013191. ACM, New York (1989)"},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters\u00a06(3), 80\u201382 (1977)","journal-title":"Information Processing Letters"},{"issue":"l","key":"3_CR22","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 Computing\u00a09(l), 51\u201360 (1995)","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39989-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T03:02:43Z","timestamp":1637118163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39989-6_3"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201847","9783540399896"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39989-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}