{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:02Z","timestamp":1742598602731,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584292"},{"type":"electronic","value":"9783540487876"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58429-3_35","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:01:30Z","timestamp":1330272090000},"page":"161-175","source":"Crossref","is-referenced-by-count":10,"title":["Routing algorithms for IBM SP1"],"prefix":"10.1007","author":[{"given":"B\u00fclent","family":"Abali","sequence":"first","affiliation":[]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"C. B. Stunkel, D. G. Shea, B. Abali, M. M. Denneau, P. H. Hochschild, D. J. Joseph, B. J. Nathanson, M. Tsao, and P. R. Varker, \u201cArchitecture and Implementation of Vulcan,\u201d in Proc. Int. Parallel Processing Symp., pp. 268\u2013274, April 1994. An extended version is also available as Research Report RC19492 from the IBM T.J. Watson Research Center.","DOI":"10.1109\/IPPS.1994.288290"},{"key":"12_CR2","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, \u201cDeadlock-Free Message Routing in Multiprocessor Interconnection Networks,\u201d IEEE Transactions on Computers, vol. C-36, pp. 547\u2013553, May 1987.","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR3","first-page":"267","volume":"3","author":"P. Kermani","year":"1979","unstructured":"P. Kermani and L. Kleinrock, \u201cVirtual Cut-Through: A new computer communications switching technique,\u201d Computer Networks, vol. 3, pp. 267\u2013286, September 1979.","journal-title":"Computer Networks"},{"key":"12_CR4","volume-title":"Computer Networks","author":"A. S. Tanenbaum","year":"1981","unstructured":"A. S. Tanenbaum, Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1981."},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1109\/T-C.1975.224157","volume":"C-24","author":"D. H. Lawrie","year":"1975","unstructured":"D. H. Lawrie, \u201cAccess and alignment of data in an array processor,\u201d IEEE Transactions on Computers, vol. C-24, pp. 1145\u20131155, December 1975.","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/TC.1977.1674863","volume":"C-26","author":"M. C. Pease","year":"1977","unstructured":"M. C. Pease, \u201cThe indirect binary n-cube microprocessor array,\u201d IEEE Transactions on Computers, vol. C-26, pp. 458\u2013473, May 1977.","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1109\/5.92043","volume":"79","author":"S. A. Felperin","year":"1991","unstructured":"S. A. Felperin, L. Gravano, G. D. Pifarre, and J. L. C. Sanz, \u201cRouting Techniques for Massively Parallel Communication,\u201d Proceedings of the IEEE, vol. 79, pp. 488\u2013503, April 1991.","journal-title":"Proceedings of the IEEE"},{"key":"12_CR8","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. NY: McGraw-Hill, 1990."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"R. V. Boppana and S. Chalasani, \u201cA Comparison of Adaptive Warmhole Routing Algorithms,\u201d in Proceedings of the 20th Ann. Int. Symp. on Computer Architecture, pp. 351\u2013360, May 1993.","DOI":"10.1145\/165123.165177"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/0743-7315(92)90013-D","volume":"16","author":"T. Bultan","year":"1992","unstructured":"T. Bultan and C. Aykanat, \u201cA New Mapping Heuristic Based on Mean Field Annealing,\u201d J. Parallel and Distributed Comput., vol. 16, pp. 292\u2013305, 1992.","journal-title":"J. Parallel and Distributed Comput."},{"issue":"no.12","key":"12_CR11","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1109\/12.9733","volume":"37","author":"C. Aykanat","year":"1988","unstructured":"C. Aykanat, F. Ozguner, P. Ercal, and P. Sadayappan, \u201cIterative Algorithms for Solution of Large Sparse Systems of Linear Equations on Hypercubes,\u201d IEEE Trans. Comput, vol. 37, no. 12, pp. 1554\u20131567, 1988.","journal-title":"IEEE Trans. Comput"},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1109\/12.166603","volume":"41","author":"D. D. Kandlur","year":"1992","unstructured":"D. D. Kandlur and K. G. Shin, \u201cTraffic Routing for Multicomputer Networks with Virtual Cut-Through Capability,\u201d IEEE Transactions on Computers, vol. 41, pp. 1257\u20131270, October 1992.","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/71.224220","volume":"4","author":"B. Abali","year":"1993","unstructured":"B. Abali, F. Ozguner, and A. Bataineh, \u201cBalanced Parallel Sort on Hypercube Multiprocessors,\u201d IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 572\u2013581, May 1993.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. W. Kernighan","year":"1970","unstructured":"B. W. Kernighan and S. Lin, \u201cAn efficient heuristic procedure for partitioning graphs,\u201d Bell System Tech. J., vol. 49, pp. 291\u2013307, 1970.","journal-title":"Bell System Tech. J."}],"container-title":["Lecture Notes in Computer Science","Parallel Computer Routing and Communication"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58429-3_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:28:15Z","timestamp":1742596095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58429-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584292","9783540487876"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-58429-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}