{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:33:25Z","timestamp":1648730005016},"reference-count":11,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1016\/s0020-0190(00)00022-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:49:03Z","timestamp":1027604943000},"page":"221-225","source":"Crossref","is-referenced-by-count":1,"title":["Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms"],"prefix":"10.1016","volume":"73","author":[{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00022-3_ID003","series-title":"Proc. 10th Annual ACM Symposium on Principles of Distributed Computing","first-page":"177","article-title":"Efficient deadlock-free routing","author":"Awerbuch","year":"1991"},{"key":"10.1016\/S0020-0190(00)00022-3_ID004","series-title":"Proc. 7th IEEE Symposium on Parallel and Distributed Processing","article-title":"Minimal, deadlock-free routing in hypercubic and arbitrary networks","author":"Cypher","year":"1995"},{"key":"10.1016\/S0020-0190(00)00022-3_ID005","series-title":"Proc. 14th Annual ACM Symposium on Principles of Distributed Computing","first-page":"25","article-title":"Requirements for deadlock-free, adaptive packet routing","author":"Cypher","year":"1992"},{"issue":"5","key":"10.1016\/S0020-0190(00)00022-3_ID006","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","article-title":"Deadlock-free message routing in multiprocessor interconnection networks","volume":"Vol. 36","author":"Dally","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(00)00022-3_ID007","series-title":"Proc. 3rd IEEE Symposium on Parallel and Distributed Processing","article-title":"Deadlock-free adaptive routing algorithms for multicomputers: Evaluation of a new algorithm","author":"Duato","year":"1991"},{"issue":"12","key":"10.1016\/S0020-0190(00)00022-3_ID008","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1109\/TCOM.1985.1096253","article-title":"Prevention of store-and-forward deadlock in computer networks","volume":"Vol. 33","author":"Gopal","year":"1985","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"10.1016\/S0020-0190(00)00022-3_ID009","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1109\/TCOM.1981.1095021","article-title":"Prevention of deadlocks in packet-switched data transport systems","volume":"Vol. 29","author":"G\u00fcnther","year":"1981","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"10.1016\/S0020-0190(00)00022-3_ID010","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1109\/TCOM.1980.1094666","article-title":"Deadlock avoidance in store-and-forward networks","volume":"Vol. 28","author":"Merlin","year":"1980","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0020-0190(00)00022-3_ID011","series-title":"Deadlock-free packet routing, in: Introduction to Distributed Algorithms","author":"Tel","year":"1994"},{"issue":"4","key":"10.1016\/S0020-0190(00)00022-3_ID012","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/0210053","article-title":"Some complexity results in the design of deadlock-free packet switching networks","volume":"Vol. 10","author":"Toueg","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0020-0190(00)00022-3_ID013","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0210044","article-title":"Deadlock-free packet switching networks","volume":"Vol. 10","author":"Toueg","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000223?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000223?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T02:26:24Z","timestamp":1556504784000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":11,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0020019000000223"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00022-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}