{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:29:54Z","timestamp":1761596994862},"reference-count":7,"publisher":"Wiley","issue":"10","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":8792,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1982,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A distributed solution to Dijkstra's \u2018Dining Philosophers\u2019 problem is presented. There is no central synchronization mechanism and it is robust in that the impact of failures is local. The solution is amenable to implementation using a wide class of synchronization primitives. A concrete implementation is presented in Ada.<\/jats:p>","DOI":"10.1002\/spe.4380121009","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T12:20:01Z","timestamp":1163766001000},"page":"965-969","source":"Crossref","is-referenced-by-count":10,"title":["A robust distributed solution to the dining philosophers problem"],"prefix":"10.1002","volume":"12","author":[{"given":"T. A.","family":"Cargill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289519"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/359642.359651"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359585"},{"key":"e_1_2_1_5_2","volume-title":"Structured Concurrent Programming with Operating Systems Applications","author":"Holt R. C.","year":"1978"},{"key":"e_1_2_1_6_2","first-page":"71","article-title":"n\u2010philosophers: an exercise in distributed control","volume":"4","author":"Chang E.","year":"1980","journal-title":"Computer Networks"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"N.FrancezandM.Rodeh \u2018A distributed abstract data type implementation by a probabilistic communication scheme \u2019Proc. 21st Annual Symp. on the Foundations of Computer Science 373\u2013379(1980).","DOI":"10.1109\/SFCS.1980.2"},{"key":"e_1_2_1_8_2","volume-title":"Complexity of communication among asynchronous parellel processes","author":"Burns J. E.","year":"1981"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380121009","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380121009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T09:49:26Z","timestamp":1699782566000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380121009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":7,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["10.1002\/spe.4380121009"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380121009","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}