{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:40:06Z","timestamp":1736084406501,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020426","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"89-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Coping with contention"],"prefix":"10.1007","author":[{"given":"Manhoi","family":"Choy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ambuj K.","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson. On achieving consensus using a shared memory. In Proceedings of the 7th Annual ACM Symposium on the Principles of Distributed Computing, pages 291\u2013302, 1988.","DOI":"10.1145\/62546.62594"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Y. Afek, E. Gafni, Tromp J., and Vitanyi P. Wait-free test-and-set. In Proceedings of the 6th International Workshop on Distributed Algorithms, pages 85\u201394, 1992.","DOI":"10.1007\/3-540-56188-9_6"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"T. E. Anderson","year":"1990","unstructured":"T. E. Anderson. The performance of spin-lock alternatives for sharedmemory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(1):6\u201316, 1990.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"11","author":"J. Aspnes","year":"1990","unstructured":"J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441\u2013461, 1990.","journal-title":"Journal of Algorithms"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"J. Aspnes, M. Herlihy, and N. Shavit. Counting networks and multiprocessor coordination. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991.","DOI":"10.21236\/ADA237475"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"M. Choy and A. K. Singh. Adaptive solutions to the mutual exclusion problem. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, August 1993.","DOI":"10.1145\/164051.164073"},{"issue":"9","key":"7_CR7","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"E. W. Dijkstra","year":"1965","unstructured":"E. W. Dijkstra. Solution of a problem in concurrent program control. Communications of the ACM, 8(9):569, Sept. 1965.","journal-title":"Communications of the ACM"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Herlihy, and O. Waarts. Contention in shared memory algorithms. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 174\u2013183, May 1993.","DOI":"10.1145\/167088.167145"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"P. B. Gibbons, Y. Matias, and V. Ramachandran. The QRQW PRAM: Accounting for contention in parallel algorithms. In Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 638\u2013648, 1994.","DOI":"10.1145\/181014.181382"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"A. Gottlieb, R. Grishman, C. P. Kruskal, K. M. McAuliffe, L. Rudolph, and M. Snir. The NYU ultracomputer \u2014 designing an mimd shared memory parallel computer. IEEE Transactions on Computers, C-32(2), 1983.","DOI":"10.1109\/TC.1983.1676201"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124\u2013149, 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"M. Herlihy, B. H. Lim, and N. Shavit. Low contention load balancing on large-scale multiprocessors. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1992.","DOI":"10.1145\/140901.140924"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"J. M. Mellor-Crummey and M. S. Scott. Synchronization without contention. In Proceedings of the 4th International Conference on Architectural Support for Programming Languages and Systems, pages 269\u2013278, April 1991.","DOI":"10.1145\/106972.106999"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Shavit N. and Zemach A. Diffracting trees. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 167\u2013176, 1994.","DOI":"10.1145\/181014.181326"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF00288965","volume":"17","author":"M. Rabin","year":"1982","unstructured":"M. Rabin. The choice coordination problem. Acta Informatica, 17:121\u2013134, 1982.","journal-title":"Acta Informatica"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"M. Rabin and D. Lehmann. On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem. In Proceedings of the 8th Annual ACM Symposium on the Principles of Programming Languages, pages 133\u2013138, 1981.","DOI":"10.1145\/567532.567547"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"E. Styer. Improving fast mutual exclusion. In Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, pages 159\u2013168, August 1992.","DOI":"10.1145\/135419.135453"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"J. Yang and J. H. Adderson. Fast, scalable synchronization with minimal hardware support. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, pages 171\u2013182, 1993.","DOI":"10.1145\/164051.164072"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"J. Yang and J. H. Adderson. Time bounds for mutual exclusion and related problems. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994.","DOI":"10.1145\/195058.195139"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:01:42Z","timestamp":1736082102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020426"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0020426","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}