{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:46Z","timestamp":1725663826777},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540567318"},{"type":"electronic","value":"9783540476375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56731-3_15","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:27:57Z","timestamp":1330255677000},"page":"156-165","source":"Crossref","is-referenced-by-count":1,"title":["An experimental study of wormhole routing in parallel computers"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Felperin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhakar","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"B. Aiello, F.T. Leighton, B. Maggs, and M. Newman. Fast algorithms for bit-serial routing on a hypercube. In Second Annual ACM Symposium on Parallel Algorithms and Architectures, pages 55\u201364. ACM Press, 1990.","DOI":"10.1145\/97444.97459"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"R. Aleliunas. Randomized parallel communication. In ACM-SIGOPS Symposium on Principles of Distributed Systems, pages 60\u201372, 1982.","DOI":"10.1145\/800220.806683"},{"key":"15_CR3","unstructured":"W.C. Athas. Physically compact, high performance multicomputers. In Sixth MIT Conference on Advanced Research in VLSI, pages 302\u2013313. MIT Press, 1990."},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Math. Stat., 23:493\u2013509, 1952.","journal-title":"Annals of Math. Stat."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1109\/12.53599","volume":"39","author":"W. Dally","year":"1990","unstructured":"W. Dally. Performance analysis of k ary n cube interconnection networks. IEEE Trans. Computers, 39:775\u2013785, 1990.","journal-title":"IEEE Trans. Computers"},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","volume":"36","author":"W. Dally","year":"1987","unstructured":"W. Dally and C.L. Seitz. Deadlock free message routing in multiprocessor interconnection networks. IEEE Trans. Computers, 36:547\u2013553, 1987.","journal-title":"IEEE Trans. Computers"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"W.J. Dally. Fine grain message passing concurrent computers. In Third Conference on Hypercube Concurrent Computers and Applications, pages 2\u201312. ACM Press, 1988.","DOI":"10.21236\/ADA200789"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"W.J. Dally. Virtual channel flow control. In Seventeenth Annual International Symposium on Computer Architecture, pages 60\u201368. ACM Press, 1990.","DOI":"10.1145\/325096.325115"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"J. Duato. On the design of deadlock free adaptive routing algorithms for multicomputers: theoretical aspects. In Second European Conference on Distributed Memory Computing, pages 234\u2013243. Springer Verlag LNCS 487, 1991.","DOI":"10.1007\/BFb0032940"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"S. Felperin, P. Raghavan, and E. Upfal. A theory of wormhole routing in parallel computers. In 33th Annual Symposium on Foundations of Computer Science, 1992, to appear.","DOI":"10.1109\/SFCS.1992.267795"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"F.T. Leighton. Average case analysis of greedy routing algorithms on arrays. In Second Annual ACM Symposium on Parallel Algorithms and Architectures, pages 2\u201310. ACM Press, 1990.","DOI":"10.1145\/97444.97448"},{"key":"15_CR12","unstructured":"M. Noakes and W.J. Dally. System design of the j machine. In Sixth MIT Conference on Advanced Research in VLSI, pages 179\u2013194. MIT Press, 1990."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"W.H. Press, Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press, 1988.","DOI":"10.1016\/S0003-2670(00)82860-3"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"A. Ranade. How to emulate shared memory. In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pages 185\u2013194, 1987.","DOI":"10.1109\/SFCS.1987.32"},{"key":"15_CR15","unstructured":"D.S. Reeves, E.F. Gehringer, and A. Chandiramani. Adaptive routing and deadlock recovery: a simulation study. In Fourth Conference on Hypercube Concurrent Computers and Applications, pages 331\u2013337. Golden Gate Enterprises, 1989."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"C.L. Seitz, W.C. Athas, C.M. Flaig, A.J. Martin, J. Seizovic, C.S. Steele, and W.K. Su. The architecture and programming of the Ametek Series 2010 multicomputer. In Third Conference on Hypercube Concurrent Computers and Applications, pages 33\u201336. ACM Press, 1988.","DOI":"10.1145\/62297.62302"},{"key":"15_CR17","unstructured":"R.J. Smith II. Experimental system kit hardware. In Fourth Conference on Hypercube Concurrent Computers and Applications, pages 713\u2013725. Golden Gate Enterprises, 1989."},{"key":"15_CR18","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1145\/828.1892","volume":"31","author":"E. Upfal","year":"1984","unstructured":"E. Upfal. Efficient schemes for parallel communication. Journal of the ACM, 31:507\u2013517, 1984.","journal-title":"Journal of the ACM"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Eli Upfal. An O(log N) deterministic packet routing scheme. In 21st ACM Annual Symposium on Theory of Computing, pages 241\u2013250, 1989.","DOI":"10.1145\/73007.73030"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pages 263\u2013277, Milwaukee, Wisconsin, May 1981.","DOI":"10.1145\/800076.802479"},{"issue":"2","key":"15_CR21","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0211027","volume":"11","author":"L. G. Valiant","year":"1982","unstructured":"L.G. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11(2):350\u2013361, 1982.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Parallel Architectures and Their Efficient Use"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56731-3_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:24:21Z","timestamp":1687285461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56731-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540567318","9783540476375"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-56731-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}