{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:04Z","timestamp":1742617204427,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616269"},{"type":"electronic","value":"9783540706335"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996]]},"DOI":"10.1007\/3-540-61626-8_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:04:28Z","timestamp":1330293868000},"page":"195-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A comparison of input and output driven routers"],"prefix":"10.1007","author":[{"given":"Melanie L.","family":"Fulgham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Snyder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"P. Berman, L. Gravano, G. Pifarr\u00e9, and J. Sanz. Adaptive deadlock-and livelock-free routing with all minimal paths in torus networks. In Proc. of SPAA, 1992.","DOI":"10.1145\/140901.140902"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"M. Blumrich, K. Li, R. Alpert, C. Dubnicki, and E. Felten. Virtual memory mapped network interface for the SHRIMP multicomputer. In Proc. of ISCA, pages 142\u2013153, 1994.","DOI":"10.1145\/192007.192024"},{"key":"25_CR3","volume-title":"PhD thesis","author":"K. Bolding","year":"1993","unstructured":"K. Bolding. Chaotic Routing: Design and Implementation of an Adaptive Multicomputer Network Router. PhD thesis, University of Washington, Seattle, July 1993."},{"key":"25_CR4","unstructured":"K. Bolding, M. Fulgham, and L. Snyder. The case for chaotic adaptive routing. IEEE Transactions on Computers, to appear."},{"key":"25_CR5","unstructured":"L. Cherkasova and T. Rokicki. Alpha message scheduling for packet-switched interconnects. Technical Report TR HPL-94-72, Hewlett-Packard Labs, 1994."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"A. Chien and J. Kim. Planar-adaptive routing: Low-cost adaptive networks for multiprocessors. In Proc. of the Intl. Sym. on Computer Architecture, pages 268\u2013277, 1992.","DOI":"10.1145\/146628.140383"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"W. Dally. Virtual-channel flow control. In Proc. of the Intl. Sym. on Comp. Arch., May 1990.","DOI":"10.1145\/325164.325115"},{"issue":"5","key":"25_CR8","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","volume":"C-36","author":"W. Dally","year":"1987","unstructured":"W. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547\u2013553, May 1987.","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"25_CR9","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1109\/71.219761","volume":"4","author":"J. Duato","year":"1993","unstructured":"J. Duato. A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Transactions on Parallel and Distributed Systems, 4(4):466\u2013475, Apr. 1993.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"25_CR10","volume-title":"Technical Report UW-CSE-96-06-01","author":"M. Fulgham","year":"1996","unstructured":"M. Fulgham and L. Snyder. A comparison of input and output driven routers. Technical Report UW-CSE-96-06-01, Univ. of Washington, Seattle, 1996."},{"key":"25_CR11","volume-title":"Technical Report UW-CSE-96-01-11","author":"M. Fulgham","year":"1996","unstructured":"M. Fulgham and L. Snyder. Triplex router: a versatile torus routing algorithm. Technical Report UW-CSE-96-01-11, Univ. of Washington, Seattle, 1996."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"C. Glass and L. Ni. Adaptive routing in mesh-connected networks. In Proc. of the Intl. Conf. on Distributed Computing Systems, pages 12\u201319, 1992.","DOI":"10.1109\/ICDCS.1992.235060"},{"issue":"5","key":"25_CR13","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/185675.185682","volume":"41","author":"C. J. Glass","year":"1994","unstructured":"C. J. Glass and L. M. Ni. The turn model for adaptive routing. JACM, 41(5):874\u2013902, 1994.","journal-title":"JACM"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0376-5075(79)90032-1","volume":"3","author":"P. Kermani","year":"1979","unstructured":"P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks, 3:267\u2013286, 1979.","journal-title":"Computer Networks"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"S. Konstantinidou. The segment router: a novel router design for parallel computers. In Proc. of the Sym. of Parallel Algorithms and Architectures, pages 364\u2013373, 1994.","DOI":"10.1145\/181014.181459"},{"issue":"12","key":"25_CR16","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1109\/12.338098","volume":"43","author":"S. Konstantinidou","year":"1994","unstructured":"S. Konstantinidou and L. Snyder. The chaos router. IEEE Transactions on Computers, 43(12):1386\u201397, Dec. 1994.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/12.67315","volume":"C-40","author":"D. H. Linder","year":"1991","unstructured":"D. H. Linder and J. C. Harden. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers, C-40(1):2\u201312, Jan. 1991.","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR18","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-58429-3_43","volume":"853","author":"N. McKenzie","year":"1994","unstructured":"N. McKenzie, K. Bolding, C. Ebeling, and L. Snyder. CRANIUM: An interface for message passing on adaptive packet routing networks. In Lecture Notes in Computer Science, volume 853, pages 266\u201380, 1994.","journal-title":"Lecture Notes in Computer Science"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"L. Schwiebert and D. Jayasimha. A universal proof technique for deadlock-free routing in interconnection networks. In Proc. of the Sym. on Par. Alg. and Arch., pages 175\u2013184, 1995.","DOI":"10.1145\/215399.215440"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"T. von Eicken D.E. Culler, S. Goldstein, and K. Schauser. Active messages: a mechanism for integrated communication and computation. In Proc. of ISCA, pages 256\u2013266, May 1992.","DOI":"10.1145\/146628.140382"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61626-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:22:42Z","timestamp":1742599362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61626-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616269","9783540706335"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61626-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}