{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:47Z","timestamp":1725663947210},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540554370"},{"type":"electronic","value":"9783540470731"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55437-8_83","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:04:31Z","timestamp":1330232671000},"page":"226-237","source":"Crossref","is-referenced-by-count":1,"title":["Multipacket routing on rings"],"prefix":"10.1007","author":[{"given":"Fillia","family":"Makedon","sequence":"first","affiliation":[]},{"given":"Adonios","family":"Simvonis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"B. Aielo, F.T. Leighton, B. Maggs, M. Newman, \u201cFast Algorithms for Bit-Serial Routing on a Hypercube\u201d, Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '90, July 2\u20136, 1990, Crete, Greece.","DOI":"10.1145\/97444.97459"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"D. Krizanc, S. Rajasekaran, Th. Tsantilas, \u201cOptimal Routing Algorithms for Mesh-Connected Processor Arrays\u201d, VLSI Algorithms and Architectures (AWOC'88), J. Reif, editor, Lecture Notes in Computer Science 319, 1988, pp. 411\u2013422.","DOI":"10.1007\/BFb0040408"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"M. Kunde, \u201cRouting and Sorting on Mesh-Connected Arrays\u201d, VLSI Algorithms and Architectures (AWOC'88), J. Reif, editor, Lecture Notes in Computer Science 319, 1988, pp. 423\u2013433.","DOI":"10.1007\/BFb0040409"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"M. Kunde,T. Tensi, \u201cMulti-Packet Routing on Mesh Connected Arrays\u201d, Proceedings of ACM Symposium on Parallel Algorithms and Architectures, SPAA'89, June 1989, pp. 336\u2013343.","DOI":"10.1145\/72935.72971"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, \u201cAverage Case Analysis of Greedy Routing Algorithms on Arrays\u201d, Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '90, July 2\u20136, 1990, Crete, Greece.","DOI":"10.1145\/97444.97448"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, F. Makedon, I.G. Tollis, \u201cA 2n-2 Algorithm for Routing in n\u00d7n Array With Constant Size Queues\u201d, Proceedings of ACM Symposium on Parallel Algorithms and Architectures, SPAA'89, June 1989, pp. 328\u2013335.","DOI":"10.1145\/72935.72970"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"F. Makedon, A. Simvonis, \u201cFast Parallel Communication on Mesh Connected Machines with Low Buffer Requirements\u201d, Proceedings of the 1990 IEEE International Conference on Computer Design (ICCD '90).","DOI":"10.1109\/ICCD.1990.130166"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"F. Makedon, A. Simvonis, \u201cOn Bit-Serial Packet Routing for the Mesh and the Torus\u201d, Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation, October 8\u201310 1990, pp. 294-302.","DOI":"10.1109\/FMPC.1990.89475"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"J.Y. Ngai,C.L. Seitz, \u201cA Framework for Adaptive Routing in Multicomputer Networks\u201d, Proceedings of ACM Symposium on Parallel Algorithms and Architectures, SPAA'89, June 1989, pp. 1\u20139.","DOI":"10.1145\/72935.72936"},{"key":"17_CR10","unstructured":"S. Rajasekaran, R. Overholt, \u201cConstant Queue Routing on a Mesh\u201d, to appear in the Journal of Parallel and Distributed Computing."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"A.G. Ranade, \u201cHow to Emulate Shared Memory\u201d, Proceedings of the 28th IEEE Symposium on Foundation of Computer Science, 1987, pp. 185\u2013194.","DOI":"10.1109\/SFCS.1987.32"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, G.J. Brebner, \u201cUniversal Schemes for Parallel Communication\u201d, Proceedings of the 13th Annual ACM Symposium on the Theory of Computing, May 1981, pp. 263\u2013277.","DOI":"10.1145\/800076.802479"}],"container-title":["Lecture Notes in Computer Science","Parallel Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55437-8_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:58:52Z","timestamp":1605628732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55437-8_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540554370","9783540470731"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-55437-8_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}