{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:07:08Z","timestamp":1742389628332},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020441","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:21:02Z","timestamp":1131844862000},"page":"296-310","source":"Crossref","is-referenced-by-count":4,"title":["An algorithm with optimal failure locality for the dining philosophers problem"],"prefix":"10.1007","author":[{"given":"Yih-Kuen","family":"Tsay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajive L.","family":"Bagrodia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and M. Saks. A dining philosophers algorithm with polynomial response time. In Proceedings of the 31st IEEE Conference on Foundations of Computer Science, pages 65\u201374, 1990.","DOI":"10.1109\/FSCS.1990.89525"},{"issue":"9","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1109\/32.31364","volume":"15","author":"R.L. Bagrodia","year":"1989","unstructured":"R.L. Bagrodia. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE Transactions on Software Engineering, 15(9):1053\u20131065, September 1989.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/69558.69561","volume":"11","author":"R.L. Bagrodia","year":"1989","unstructured":"R.L. Bagrodia. Synchronization of asynchronous processes in CSP. ACM TOPLAS, 11(4):585\u2013597, October 1989.","journal-title":"ACM TOPLAS"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/69624.357208","volume":"5","author":"G. Buckley","year":"1983","unstructured":"G. Buckley and A. Silberschatz. An effective implementation of the generalized input-output construct of CSP. ACM TOPLAS, 5(2):223\u2013235, April 1983.","journal-title":"ACM TOPLAS"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K.M. Chandy","year":"1984","unstructured":"K.M. Chandy and J. Misra. The drinking philosophers problem. ACM TOPLAS, 6(4):632\u2013646, October 1984.","journal-title":"ACM TOPLAS"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"K.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"M. Choy and A.K. Singh. Efficient fault tolerant algorithms for resource allocation in distributed systems. In Proceedings of the 24th ACM Symposium on Theory of Computing, 1992.","DOI":"10.1145\/129712.129770"},{"key":"22_CR8","unstructured":"M. Choy and A.K. Singh. Tight lower bounds on failure locality of distributed synchronization. In Proceedings of the 30th Annual Allerton Conference on Communication, Control, and Computing, pages 127\u2013136, 1992."},{"key":"22_CR9","unstructured":"M. Choy and A.K. Singh. Private communication, 1994."},{"key":"22_CR10","unstructured":"E.W. Dijkstra. Two starvation free solutions of a general exclusion problem, 1978. EWD 625, Plataanstraat 5, 5671 AL Nuenen, Netherlands."},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77\u201397, January 1987.","journal-title":"Journal of the ACM"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"M.J. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374\u2013382, April 1985.","journal-title":"Journal of the ACM"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"D. Lehmann and M.O. Rabin. On the advantage of free choice: A symmetric and fully distributed solution to the dining philosophers problem. In Proceedings of the 8th ACM Symposium on Principles of Programming Languages, 1981.","DOI":"10.1145\/567532.567547"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"N.A. Lynch. Fast allocation of nearby resources in a distributed system. In Proceedings of the 12th ACM Symposium on Theory of Computing, 1980.","DOI":"10.1145\/800141.804654"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"M. Naor and L. Stockmeyer. What can be computed locally. In Proceedings of the 25th ACM Symposium on Theory of Computing, 1993.","DOI":"10.1145\/167088.167149"},{"key":"22_CR16","unstructured":"S. Ramesh. A new implementation of CSP with output guards. In Proceedings of the 7th International Conference on Distributed Computing Systems, pages 266\u2013273, 1987."},{"issue":"2","key":"22_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1145\/357162.357163","volume":"4","author":"F.B. Schneider","year":"1982","unstructured":"F.B. Schneider. Synchronization in distributed programs. ACM TOPLAS, 4(2):125\u2013148, April 1982.","journal-title":"ACM TOPLAS"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"A.P. Sistla. Distributed algorithms for ensuring fair interprocess communication. In Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, pages 266\u2013277, 1984.","DOI":"10.1145\/800222.806753"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"E. Styer and G.L. Peterson. Improved algorithms for distributed resource allocation. In Proceedings of the 7th ACM Symposium on Principles of Distributed Computing, pages 105\u2013116, 1988.","DOI":"10.1145\/62546.62567"},{"key":"22_CR20","unstructured":"Y.-K. Tsay. Distributed Coordination of Process Interactions \u2014 Fairness and Fault-Tolerance. PhD thesis, UCLA, September 1993. Also available as technical report CSD-930034."},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Y.-K. Tsay and R.L. Bagrodia. Fault-tolerant algorithms for fair interprocess synchronization. IEEE Transactions on Parallel and Distributed Systems, 5(6), June 1994.","DOI":"10.1109\/71.296319"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T16:46:18Z","timestamp":1586537178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0020441","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}