{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:21:54Z","timestamp":1743002514710,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0024487","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"52-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Acyclic orientations for deadlock prevention in interconnection networks"],"prefix":"10.1007","author":[{"given":"Jean-Claude","family":"Bermond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miriam","family":"Di Ianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Flammini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephane","family":"Perennes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, S. Kutten, and D. Peleg. Efficient deadlock-free routing. In 10th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 177\u2013188, Montreal, Canada, 1991.","DOI":"10.1145\/112600.112616"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"P.E. Berman, L. Gravano, G.D. Pifarr\u00e9, and J.L.C. Sanz. Adaptive deadlock and livelock-free routing with all minimal paths in torus networks. In 4th Symposium on Parallel Algorithms and Architectures (SPAA), pages 3\u201312, June 1992.","DOI":"10.1145\/140901.140902"},{"key":"6_CR3","unstructured":"J.C. Bermond and M. Syska. Routage wormhole et canaux virtuel. In M. Cosnard M. Nivat and Y. Robert, editors, Algorithmique Parall\u00e8le, pages 149\u2013158. Masson, 1992."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Robert Cypher and Luis Gravano. Requirements for deadlock-free, adaptive packet routing. In 11th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 25\u201333, 1992.","DOI":"10.1145\/135419.135425"},{"issue":"5","key":"6_CR5","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","volume":"C-36","author":"W. J. Dally","year":"1987","unstructured":"W. J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comp., C-36, N.5:547\u2013553, May 1987.","journal-title":"IEEE Trans. Comp."},{"key":"6_CR6","unstructured":"M. Di Ianni, M. Flammini, R. Flammini, and S. Salomone. Systolic acyclic orientations for deadlock prevention. In 2nd Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 1\u201312. Carleton University Press, 1995."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"J. Duato. Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm. In 3rd IEEE Symposium on Parallel and Distributed Processing, 1991.","DOI":"10.1007\/BFb0035117"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"J. Duato. On the design of deadlock-free adaptive routing algorithms for multicomputers: theoretical aspects. In 2nd European Conference on Distributed Memory Computing, volume 487 of Lecture Notes in Computer Science, pages 234\u2013243. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0032940"},{"key":"6_CR9","series-title":"Research Report","volume-title":"Deadlocks in adaptive wormhole routing","author":"E. Fleury","year":"1994","unstructured":"E. Fleury and P. Fraigniaud. Deadlocks in adaptive wormhole routing. Research Report, Laboratoire de l'Informatique du Parall\u00e9lisme, LIP, \u00c9cole Normale Sup\u00e9rieure de Lyon, 69364 Lyon Cedex 07, France, March 1994."},{"key":"6_CR10","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability. A Guide to the Theory of NP-completeness. W.H. Freeman, 1977."},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1109\/TCOM.1981.1095021","volume":"COM-29","author":"K.D. Gunther","year":"1981","unstructured":"K.D. Gunther. Prevention of deadlock in packet-switched data transport system. IEEE Trans. on Commun., COM-29:512\u2013514, May 1981.","journal-title":"IEEE Trans. on Commun."},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1109\/TCOM.1980.1094666","volume":"COM-28","author":"P.M. Merlin","year":"1980","unstructured":"P.M. Merlin and P.J. Schweitzer. Deadlock avoidance in store-and-forward networks: Store and forward deadlock. IEEE Trans. on Commun., COM-28:345\u2013352, March 1980.","journal-title":"IEEE Trans. on Commun."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"G.D. Pifarr\u00e9, L. Gravano, S.A. Felperin, and J.L.C. Sanz. Fully-adaptive minimal deadlock-free packet routing in hypercube, meshes, and other networks. In 3rd Symposium on Parallel Algorithms and Architectures (SPAA), pages 278\u2013290, June 1991.","DOI":"10.1145\/113379.113405"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"A.G. Ranade. How to emulate shared memory. In Foundation of Computer Science, pages 185\u2013194, 1985.","DOI":"10.1109\/SFCS.1987.32"},{"key":"6_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0020419","volume-title":"Introduction to Distributed Algorithms","author":"G. Tel","year":"1994","unstructured":"Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, U.K., 1994."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024487","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T18:59:21Z","timestamp":1736103561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024487"}},"subtitle":["extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0024487","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}