{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:32Z","timestamp":1725456332650},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029992","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:24:59Z","timestamp":1133400299000},"page":"488-497","source":"Crossref","is-referenced-by-count":1,"title":["Routing with finite speeds of memory and network"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"49_CR1","unstructured":"Ding, K.-S., C.-T. Ho, J. J. Tsay, \u2018Matrix Transpose on Meshes with Wormhole and XY Routing,\u2019 Proc. 6th Symposium on Parallel and Distributed Processing, pp. 656\u2013663, IEEE, 1994."},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/0167-8191(94)00110-V","volume":"21","author":"S.E. Hambrusch","year":"1995","unstructured":"Hambrusch, S.E., F. Hameed, A. Khokhar, \u2018Communication Operations on Coarse-Grained Architectures,\u2019 Parallel Computing, 21, pp. 731\u2013751, 1995.","journal-title":"Parallel Computing"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., U. Meyer, J.F. Sibeyn, \u2018Matrix Transpose on Meshes: Theory and Practice,\u2019 Proc. 11th International Parallel Processing Symposium, IEEE, 1997, to appear.","DOI":"10.1109\/IPPS.1997.580918"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Scott, D.S., \u2018Efficient All-to-All Communication Patterns in Hypercube and Mesh Topologies,\u2019 Proc. 6th Distributed Memory Computing Conference, pp. 398\u2013403, 1991.","DOI":"10.1109\/DMCC.1991.633174"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F., F. Guillaume, T. Seidel, \u2018Practical Parallel List Ranking,\u2019 Proc. 4th Symposium on Solving Irregularly Structured Problems in Parallel, LNCS, Springer-Verlag, 1997. To appear.","DOI":"10.1007\/3-540-63138-0_3"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Stricker, T.M., J.C. Hardwick, \u2018From AAPC Algorithms to High Performance Permutation Routing and Sorting,\u2019 Proc. 8th Symp. on Parallel Algorithms and Architectures, pp. 200\u2013203, ACM, 1996.","DOI":"10.1145\/237502.237549"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Valiant, L.G., G.J. Brebner, \u2018Universal Schemes for Parallel Communication,\u2019 Proc. 13th Symposium on Theory of Computing, pp. 263\u2013277, ACM, 1981.","DOI":"10.1145\/800076.802479"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T01:44:37Z","timestamp":1549417477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029992"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0029992","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}