{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:35:16Z","timestamp":1725550516199},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297697"},{"type":"electronic","value":"9783540321002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11576235_53","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T15:32:46Z","timestamp":1129649566000},"page":"514-523","source":"Crossref","is-referenced-by-count":0,"title":["Systolic Routing in an Optical Fat Tree"],"prefix":"10.1007","author":[{"given":"Risto T.","family":"Honkanen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"Adler, M., Byers, J.W., Karp, R.M.: Scheduling Parallel Communication, the h-Relation Problem. In: Proceedings of Mathematical Foundations of Computer Science (MFCS). Prague Czech Republic, pp. 1\u201320 (1995)","DOI":"10.1007\/3-540-60246-1_109"},{"issue":"2","key":"53_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H. Fredricksen","year":"1982","unstructured":"Fredricksen, H.: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms. SIAM Review\u00a024(2), 195\u2013221 (1982)","journal-title":"SIAM Review"},{"key":"53_CR3","volume-title":"Shift Register Sequences","author":"S.W. Golomb","year":"1982","unstructured":"Golomb, S.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills (1982)"},{"key":"53_CR4","unstructured":"Honkanen, R.T.: Systolic Routing in Sparse Optical Torus. In: Proceedings of the 8th Symposium on Programming Languages and Programming Tools (SPLST 2003), Kuopio Finland, pp. 14\u201320 (2003)"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Honkanen, R., Lepp\u00e4nen, V., Penttonen, M.: Hot-Potato routing Algorithms for Sparse Optical Torus. In: Proceedings of the 2001 ICPP Workshops. Valencia Spain, pp. 302\u2013307 (2001)","DOI":"10.1109\/ICPPW.2001.951966"},{"key":"53_CR6","unstructured":"Koivistoinen, A., Pietarinen, K., Rantonen, A., Valo, T.: Visualisator for $\\mathcal{OFT}$ network. Programming project. University of Kuopio, Kuopio Finland (March 30, 2005), http:\/\/www.cs.uku.fi\/~rthonkan\/OFT\/Laski.htm"},{"key":"53_CR7","volume-title":"Introduction to parallel algorithms and architectures: arrays, trees, hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann Publishers, Inc., California (1992)"},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E., et al.: The Network Architecture of the Connection Machine CM-5. In: Proc. 4th Ann. Symp. Parallel Algorithms and Architectures, New York, USA, pp. 272\u2013285 (1992)","DOI":"10.1145\/140901.141883"},{"key":"53_CR9","unstructured":"Mellanox Technologies Inc.: InfiniBand Clustering \u2014 Delivering Better Price\/Performance than Ethernet. White paper, Mellanox Technologies Inc., Santa Clara California (2005)"},{"key":"53_CR10","unstructured":"Mitzenmacher, M., Richa, A.W., Sitaraman, R.: To appear in Handbook of Randomized Algorithms (June 24, 2002), http:\/\/www.eecs.harvard.edu\/~michaelm\/"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Raab, M., Steger, A.: \u201cBalls into Bins\u201d\u2014A Simple and Tight Analysis. In: Proceedings of 2nd Workshop on Randomize and Approximation Techniques on Computer Science (RANDOM 1998). Barcelona Spain, pp. 159\u2013170 (1998)","DOI":"10.1007\/3-540-49543-6_13"},{"key":"53_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/0471213748","volume-title":"Fundamentals of Photonics","author":"B.E.A. Saleh","year":"1991","unstructured":"Saleh, B.E.A., Teich, M.C.: Fundamentals of Photonics. John Wiley & Sons, Inc., New York (1991)"},{"key":"53_CR13","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: General Purpose Parallel Architectures. In: Algorithms and Complexity, Handbook of Theoretical Computer Science, vol. A, pp. 943\u2013971 (1990)","DOI":"10.1016\/B978-0-444-88071-0.50023-0"},{"issue":"4","key":"53_CR14","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1137\/0217042","volume":"17","author":"P.B.M. Vit\u00e1nyi","year":"1988","unstructured":"Vit\u00e1nyi, P.B.M.: Locality, Communication, and Interconnect Length in Multicomputers. SIAM Journal of Computing\u00a017(4), 659\u2013672 (1988)","journal-title":"SIAM Journal of Computing"},{"key":"53_CR15","doi-asserted-by":"crossref","unstructured":"Vit\u00e1nyi, P.B.M.: Multiprocessor Architectures and Physical Law. In: Proceedings of 2nd Workshop on Physics and Computation (PhysComp 1994), Dallas Texas, pp. 24\u201329 (1994)","DOI":"10.1109\/PHYCMP.1994.363703"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11576235_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T17:14:35Z","timestamp":1626628475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11576235_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297697","9783540321002"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11576235_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}