Skip to main content
SpringerLink
Log in

Systolic Routing in an Optical Fat Tree

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3758))

  • 752 Accesses

Abstract

In this paper we present an all-optical network architecture and a systolic routing protocol for it. An r-dimensional optical fat tree network ( \(\mathcal{OFT}\)) consists of 2r–1 routing nodes and n = 2r processing nodes deployed at the leaf nodes of the network. In our construction packets injected into the \(\mathcal{OFT}\) carry no routing information. Routing is based on the use of a cyclic 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.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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–20 (1995)

    Google Scholar 

  2. Fredricksen, H.: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms. SIAM Review 24(2), 195–221 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  3. Golomb, S.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills (1982)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. 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

  7. Leighton, F.T.: Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann Publishers, Inc., California (1992)

    MATH  Google Scholar 

  8. 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–285 (1992)

    Google Scholar 

  9. Mellanox Technologies Inc.: InfiniBand Clustering — Delivering Better Price/Performance than Ethernet. White paper, Mellanox Technologies Inc., Santa Clara California (2005)

    Google Scholar 

  10. Mitzenmacher, M., Richa, A.W., Sitaraman, R.: To appear in Handbook of Randomized Algorithms (June 24, 2002), http://www.eecs.harvard.edu/~michaelm/

  11. Raab, M., Steger, A.: “Balls into Bins”—A Simple and Tight Analysis. In: Proceedings of 2nd Workshop on Randomize and Approximation Techniques on Computer Science (RANDOM 1998). Barcelona Spain, pp. 159–170 (1998)

    Google Scholar 

  12. Saleh, B.E.A., Teich, M.C.: Fundamentals of Photonics. John Wiley & Sons, Inc., New York (1991)

    Book  Google Scholar 

  13. Valiant, L.G.: General Purpose Parallel Architectures. In: Algorithms and Complexity, Handbook of Theoretical Computer Science, vol. A, pp. 943–971 (1990)

    Google Scholar 

  14. Vitányi, P.B.M.: Locality, Communication, and Interconnect Length in Multicomputers. SIAM Journal of Computing 17(4), 659–672 (1988)

    Article  MATH  Google Scholar 

  15. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kuopio, P.O. Box 1627, FIN-70211, Kuopio, Finland

    Risto T. Honkanen

Authors
  1. Risto T. Honkanen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of CS, Georgia State University, 30302, Atlanta, GA, USA

    Yi Pan

  2. State Key Laboratory for Novel Software Technology, Nanjing University, 210093, Nanjing, Jiangsu, China

    Daoxu Chen

  3. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Minyi Guo

  4. Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong, China

    Jiannong Cao

  5. Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Honkanen, R.T. (2005). Systolic Routing in an Optical Fat Tree. In: Pan, Y., Chen, D., Guo, M., Cao, J., Dongarra, J. (eds) Parallel and Distributed Processing and Applications. ISPA 2005. Lecture Notes in Computer Science, vol 3758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576235_53

Download citation

  • DOI: https://doi.org/10.1007/11576235_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29769-7

  • Online ISBN: 978-3-540-32100-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation