{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:49Z","timestamp":1725467809650},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650669"},{"type":"electronic","value":"9783540496939"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056497","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T08:37:41Z","timestamp":1154248661000},"page":"393-407","source":"Crossref","is-referenced-by-count":8,"title":["Deriving a scalable algorithm for mutual exclusion"],"prefix":"10.1007","author":[{"given":"Yih-Kuen","family":"Tsay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"issue":"1","key":"30_CR1","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 shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(1):6\u201316, January 1990.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02283567","volume":"8","author":"M. Choy","year":"1994","unstructured":"M. Choy and A.K. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1):1\u201317, 1994.","journal-title":"Distributed Computing"},{"key":"30_CR3","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 programming control. Communications of ACM, 8:569, 1965.","journal-title":"Communications of ACM"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF00288966","volume":"17","author":"J.L.W. Kessels","year":"1982","unstructured":"J.L.W. Kessels. Arbitration without common modifiable variables. Acta Informatica, 17:135\u2013141, 1982.","journal-title":"Acta Informatica"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1):1\u201311, February 1987.","journal-title":"ACM Transactions on Computer Systems"},{"key":"30_CR6","unstructured":"N.A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996."},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"J.M. Mellor-Crummey","year":"1991","unstructured":"J.M. Mellor-Crummey and M.L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21\u201365, February 1991.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G.L. Peterson","year":"1981","unstructured":"G.L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3):115\u2013116, June 1981.","journal-title":"Information Processing Letters"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"G.L. Peterson and M.J. Fischer. Economical solutions for the critical section problem in a distributed system. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing, pages 91\u201397, 1977.","DOI":"10.1145\/800105.803398"},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01784242","volume":"9","author":"J.-H. Yang","year":"1995","unstructured":"J.-H. Yang and J.H. Anderson. A fast, scalable mutual exclusion algorithm. Distributed Computing, 9(1):51\u201360, 1995.","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T11:41:58Z","timestamp":1555760518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056497"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650669","9783540496939"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0056497","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}