{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:10Z","timestamp":1725663670170},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_145","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:19:23Z","timestamp":1330244363000},"page":"237-248","source":"Crossref","is-referenced-by-count":10,"title":["Deterministic 1 -k routing on meshes with applications to worm-hole routing"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"19_CR1","unstructured":"Athas, W.C., \u2018Physically Compact, High Performance Multicomputers,\u2019 MIT Conference on Advanced Research in VLSI, pp. 302\u2013313, 1990."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., M. Kaufmann, J.F. Sibeyn, \u2018Deterministic Permutation Routing on Meshes,\u2019 Proc. 5th Symp. on Parallel and Distributed Proc., IEEE, 1993, to appear.","DOI":"10.1109\/SPDP.1993.395448"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Dally, W.J., \u2018Virtual Channel Flow Control,\u2019 17th Symp. on Computer Architecture, pp. 60\u201368, ACM, 1990.","DOI":"10.1145\/325096.325115"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Feige, U., P. Raghavan, \u2018Exact Analysis of Hot-Potato Routing,\u2019 Proc. 33rd Symp. on Foundations of Computer Science, pp. 553\u2013562, IEEE, 1992.","DOI":"10.1109\/SFCS.1992.267796"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Felperin, S., P. Raghavan, E. Upfal, \u2018A Theory of Wormhole Routing in Parallel Computers,\u2019 Proc. 33rd Symp. on Foundations of Computer Science, pp. 563\u2013572, IEEE, 1992.","DOI":"10.1109\/SFCS.1992.267795"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., S. Rajasekaran, J.F. Sibeyn, \u2018Matching the Bisection Bound for Routing and Sorting on the Mesh,\u2019 Proc. 4th Symposium on Parallel Algorithms and Architectures, pp. 31\u201340, ACM, 1992.","DOI":"10.1145\/140901.140905"},{"key":"19_CR7","unstructured":"Kaufmann, M., J.F. Sibeyn, T. Suel, \u2018Derandomizing Algorithms for Routing and Sorting on Meshes,\u2019 Proc 5th Symposium on Discrete Algorithms, ACM-SIAM, 1994, to appear."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Kunde, M., \u2018Routing and Sorting on Mesh Connected Processor Arrays,\u2019 Proc. VLSI Algorithms and Architectures, Lecture Notes in Computer Science, 319, pp. 423\u2013433, Springer-Verlag, 1988.","DOI":"10.1007\/BFb0040409"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Kunde, M., \u2018Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound,\u2019 Proc. European Symp. on Algorithms, 1993.","DOI":"10.1007\/3-540-57273-2_62"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Leighton, T., F. Makedon, Y. Tollis, \u2018A 2n\u22122 Step Algorithm for Routing in an n x n Array with Constant Size Queues,\u2019 Proc. Symposium on Parallel Algorithms and Architectures, pp. 328\u2013335, ACM, 1989.","DOI":"10.1145\/72935.72970"},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0141-9331(93)90056-D","volume":"17","author":"F. Makedon","year":"1993","unstructured":"Makedon, F., A. Symvonis, \u2018Optimal Algorithms for the Many-to-One Routing Problem on 2-Dimensional Meshes,\u2019 Microprocessors and Microsystems, 17, pp. 361\u2013367, 1993.","journal-title":"Microprocessors and Microsystems"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Newman, I., A. Schuster, \u2018Hot-Potato Worm Routing as almost as easy as Store-and-Forward Packet Routing,\u2019 Proc. ISTCS, 1993.","DOI":"10.1109\/ISTCS.1993.253469"},{"key":"19_CR13","unstructured":"Noakes, M., W.J. Dally, 'system Design of the J-Machine,\u2019 MIT Conference on Advanced Research in VLSI, pp. 179\u2013194, 1990."},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(87)90069-7","volume":"53","author":"D. Peleg","year":"1987","unstructured":"Peleg, D., E. Upfal, \u2018The Generalized Packet Routing Problem,\u2019 Theoret. Computer Sc., 53, pp. 281\u2013293, 1987.","journal-title":"Theoret. Computer Sc."},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01758834","volume":"8","author":"S. Rajasekaran","year":"1992","unstructured":"Rajasekaran, S., Th. Tsantilas, \u2018Optimal Routing Algorithms for Mesh-Connected Processor Arrays', Algorithmica, 8, pp. 21\u201338, 1992.","journal-title":"Algorithmica"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P., A. Shamir, \u2018An Optimal Sorting Algorithm for Mesh Connected Computers,\u2019 Proc. 18th Symposium on Theory of Computing, pp. 255\u2013263, ACM, 1986.","DOI":"10.1145\/12130.12156"},{"key":"19_CR17","volume-title":"Techn. Rep. MPI-I-93-163","author":"J.F. Sibeyn","year":"1993","unstructured":"Sibeyn, J.F., M. Kaufmann, \u2018Deterministic 1-k Routing on Meshes, with Applications to Worm-Hole Routing,\u2019 Techn. Rep. MPI-I-93-163, Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 1993."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Seitz, et al., \u2018The Architecture and Programming of the Ametek Series 2010 Multicomputer', 3rd Conference on Hypercube Concurrent Computers and Applications, pp. 33\u201336, ACM, 1988.","DOI":"10.1145\/62297.62302"}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_145.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:56Z","timestamp":1605629636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_145","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}