{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:22:18Z","timestamp":1753438938195},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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\/bfb0056489","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T04:37:41Z","timestamp":1154234261000},"page":"273-287","source":"Crossref","is-referenced-by-count":2,"title":["Efficient deadlock-free multi-dimensional interval routing in interconnection networks"],"prefix":"10.1007","author":[{"given":"Rastislav","family":"Kr\u00e1\u013dovi\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Branislav","family":"Rovan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Ru\u017di\u010dka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"\u0161tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"22_CR1","first-page":"45","volume":"2","author":"E. Bakker","year":"1991","unstructured":"E. Bakker, J. van Leeuwen, R.B. Tan: Linear interval routing schemes. Algorithms Review 2, 1991, pp. 45\u201361.","journal-title":"Algorithms Review"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"R. Cypher, L. Gravano: Requirements for Deadlock-Free, Adaptive Packet Routing. In 14th Annual ACM Symposium on Principles of Distributed Computing (PODC), 1992, pp. 25\u201333.","DOI":"10.1145\/135419.135425"},{"key":"22_CR3","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, C.L. Seitz: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36, 1987, pp. 547\u2013553.","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"M. Flammini: Deadlock-Free Interval Routing Schemes. In 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 1200, Springer-Verlag, 1997, pp. 351\u2013362.","DOI":"10.1007\/BFb0023472"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"M. Flammini, G. Gambosi, U. Nanni, R. Tan: Multi-Dimensional Interval Routing Schemes. In 9th International Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, Springer-Verlag, 1995. To appear in Theoretical Computer Science.","DOI":"10.1007\/BFb0022143"},{"key":"22_CR6","unstructured":"C. Gavoille: A Survey on Interval Routing Schemes. Research Report RR-1182-97, LaBRI, Universit\u00e9 Bordeaux I, October 1997. Submitted for publication."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"R. Kr\u00e1\u013dovi\u010d, P. Ru\u017di\u010dka, D. \u0161tefankovi\u010d: The Complexity of Shortest Path and Dilation Bounded Interval Routing. In 3rd International Euro-Par Conference, Lecture Notes in Computer Science 1300, Springer-Verlag, August 1997, pp. 258\u2013265. Full version will appear in Theoretical Computer Science.","DOI":"10.1007\/BFb0002742"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1109\/TCOM.1980.1094666","volume":"COM-27","author":"P.M. Merlin","year":"1980","unstructured":"P.M. Merlin, P.J. Schweitzer: Deadlock avoidance in store-and-forward networks. IEEE Transactions of Communications, COM-27, 1980, pp. 345\u2013360.","journal-title":"IEEE Transactions of Communications"},{"key":"22_CR9","unstructured":"P. Ru\u017di\u010dka, D. \u0161tefankovi\u010d: On the Complexity of Multi-Dimensional Interval Routing Schemes. Submitted for publication."},{"key":"22_CR10","unstructured":"I. Sakko, L. Mugwaneza, Y. Langue: Routing with compact tables. Applications in Parallel and Distributed Computing (APDC), North-Holland, 1994."},{"key":"22_CR11","volume-title":"Chapter 5: Deadlock-free Packet Routing","author":"G. Tel","year":"1994","unstructured":"G. Tel: Introduction to Distributed Algorithms. (Chapter 5: Deadlock-free Packet Routing). Cambridge University Press, Cambridge, U.K., 1994."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"S. Toueg: Deadlock-free and livelock-free packet switching networks. In Proceedings of Symposium on Theory of Computing (STOCS), 1980, pp. 94\u201399.","DOI":"10.1145\/800141.804656"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1137\/0210044","volume":"10","author":"S. Toueg","year":"1981","unstructured":"S. Toueg, J. Ullman: Deadlock-free packet switching networks. SIAM Journal of Computing 10, 1981, pp. 594\u2013611.","journal-title":"SIAM Journal of Computing"},{"key":"22_CR14","unstructured":"J. van Leeuwen, R.B. Tan: Compact routing methods: A survey. In 1st International Colloquium on Structural Information and Communication Complexity (SIROCCO), Carleton Press, 1994, pp. 99\u2013110."},{"key":"22_CR15","unstructured":"J. Vounckx, G. Deconinck, R. Lauwereins, J.A. Peperstraete: Deadlock-free Fault Tolerant Wormhole Routing in Mesh-Based Massively Parallel Systems. In Technical Committee on Computer Architecture (TCCA) Newsletter, IEEE Computer Society, Summer-Fall issue, 1994, pp. 49\u201354."},{"key":"22_CR16","unstructured":"J. Vounckx, G. Deconinck, R. Cuyvers, R. Lauwereins: Minimal Deadlock-free Compact Routing in Wormhole-Switching based Injured Meshes. In Proceedings of the 2nd Reconfigurable Architectures Workshop, Santa Barbora, Ca, 1995."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T07:42:01Z","timestamp":1555746121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650669","9783540496939"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0056489","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}