Abstract
In this paper we present an all-optical network architecture and a systolic routing protocol for it. The r-dimensional optical butterfly \(({\mathcal OBF})\) network consists of r2r nodes and r2r + 1 edges. Processors are deployed at the level 0 (identical to level r) nodes of the network. Routing is based on the use of cyclical control bit sequence and scheduling. The systolic routing protocol ensures that no electro-optical conversion is needed in the intermediate routing nodes and all the packets injected into the routing machinery will reach their target without collisions. A work-optimal routing of an h-relation is achieved with a reasonable size of h.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adler, M., Byers, J.W., Karp, R.M.: Scheduling Parallel Communication: The h-relation Problem. In: Proceedings of Mathematical Foundation of Computer Science (MFCS), Prague Czech Republic, pp. 1–20 (1995)
Fredricksen, H.: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms. SIAM Review 24(2), 195–221 (1982)
Golomb, S.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills California (1982)
Haikarainen, T.: Visualisator for \(\mathcal{OBF}\) network. Special project, University of Kuopio, Kuopio (March 30, 2005), http://www.cs.uku.fi/~rthonkan/OBF/
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–20 (2003)
Honkanen, R., Leppänen, V., Penttonen, M.: Hot-Potato routing Algorithms for Sparse Optical Torus. In: Proceedings of the 2001 ICPP Workshops, Valencia, Spain, pp. 302–307 (2001)
Leighton, F.T.: Introduction to parallel algorithms and architecture: arrays, trees, hypercubes. Morgan Kaufmann Publishers Inc., California (1992)
Liu, X., Gu, Q.-P.: Multicasts on WDM All-Optical Butterfly Networks. Journal of Information Science and Engineering 18, 1049–1058 (2002)
Maggs, B.M., Sitaraman, R.K.: Simple Algorithms for Routing on Butterfly Networks with Bounded Queues. Siam J. Comput. 28(3), 984–1003 (1999)
Mitzenmacher, M., Richa, A.W., Sitaraman, R.: To appear in Handbook of Randomized Algorithm (June 24, 2002), http://www.eecs.harvard.edu/~michaelm/
Raab, M., Steger, A.: “Balls into Bins”—A Simple and Tight Analysis. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 159–170. Springer, Heidelberg (1998)
Saleh, B.E.A., Teich, M.C.: Fundamentals of Photonics. John Wiley & Sons Inc., New York (1991)
Upfal, E., Felperin, S., Snir, M.: Randomized Routing with Shorter Paths. IEEE Transactions on Parallel and Distributed Systems 7(4), 356–362 (1996)
Valiant, L.G.: General Purpose Parallel Architectures. In: Algorithms and Complexity. Handbook of Theoretical Computer Science, vol. A, pp. 943–971 (1990)
Vitányi, P.B.M.: Locality, Communication, and Interconnect Length in Multicomputers. SIAM Journal of Computing 17(4), 659–672 (1988)
Vitányi, P.B.M.: Multiprocessor Architectures and Physical Law. In: Proceedings of 2nd Workshop on Physics and Computation (PhysComp 1994), Dallas Texas, pp. 24–29 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Honkanen, R.T. (2005). Systolic Routing in an Optical Butterfly. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_12
Download citation
DOI: https://doi.org/10.1007/11535294_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28126-9
Online ISBN: 978-3-540-31826-2
eBook Packages: Computer ScienceComputer Science (R0)