Skip to main content

Abstract

Networks of Workstations (NOWs) are usually arranged as a set of interconnected switches with hosts connected to switch ports through interface cards. Several commercial interconnects for high-speed NOWs use up*/down* routing. Every time the network is powered on or the topology is changed, a configuration algorithm is executed, which provides information about the topology and generates a directed graph. Routing tables are computed from this directed graph. There are several ways to obtain the directed graph. The most frequent way is by means of algorithms based on minimum-depth spanning-trees (MDST) or propagation-order spanning-trees (POST). This paper shows that, for most networks, graphs obtained by means of these methods can be improved in order to achieve higher network performance.

This work was partly supported by the Spanish CICYT under Grant TIC97-0897-C04, and Caja Castilla-La Mancha

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Boden, N.J., Cohen, D., Felderman, R.E.: Myrinet - a gigabit per second local area network. IEEE Micro, 29–36 (February 1995)

    Google Scholar 

  2. Casado, R., Bermúdez, A., Quiles, F.J., Sánchez, J.L., Duato, J.: Performance evaluation of dynamic reconfiguration in high-speed local area networks. In: Proceedings of the sixth Symposium on High Performance Computer Architecture (HPCA-6) (January 2000)

    Google Scholar 

  3. Casado, R., Quiles, F.J., Sánchez, J.L., Duato, J.: Deadlock-free routing in irregular networks with dynamic reconfiguration. In: Sivasubramaniam, A. (ed.) CANPC 1999. LNCS, vol. 1602, pp. 165–180. Springer, Heidelberg (1999)

    Google Scholar 

  4. Cherkasova, L., Kotov, V., Rockicki, T.: Fibre channel fabrics: evaluation and design. In: Proceedings of 29th Hawaii International Conference on System Sciences (February 1995)

    Google Scholar 

  5. Dally, W.J., Seitz, C.L.: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers C-36(5) (May 1987)

    Google Scholar 

  6. Duato, J., Robles, A., Silla, F., Beivide, R.: A comparison of router architectures for virtual cut-through and wormhole switching in a NOW environment. In: Rolim, J.D.P. (ed.) IPPS-WS 1999 and SPDP-WS 1999. LNCS, vol. 1586. Springer, Heidelberg (1999)

    Google Scholar 

  7. Duato, J., Yalamanchili, S., Ni, L.: Interconnection networks. An engineering approach. IEEE Computer Society, Los Alamitos (1997)

    Google Scholar 

  8. Goldberg, D.E.: Genetic Algorithms in search, optimization and machine learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  9. Horst, R.W.: Tnet: A reliable system area network. IEEE Micro (February 1995)

    Google Scholar 

  10. Owicki, S., Karlin, A.R.: Factors in the performance of the AN1 computer network. Technical Report 88, Digital Equipment Corporation Systems Research Center, Palo Alto, CA (June 1992)

    Google Scholar 

  11. Qiao, W., Ni, L.M.: Adaptive routing in irregular networks using cut-through switches. In: Proceedings of the 1996 International Conference on Parallel Processing (ICPP 1996) (August 1996)

    Google Scholar 

  12. Rodeheffer, T.L., Schroeder, M.D.: Automatic reconfiguration in Autonet. Technical Report 77, Systems Research Center of Digital Equipment Corporation (September 1991)

    Google Scholar 

  13. Sancho, J.C., Robles, A., Duato, J.: A new methodoly to compute deadlock-free routing tables for irregular networks. In: Falsafi, B., Lauria, M. (eds.) CANPC 2000. LNCS, vol. 1797, pp. 45–60. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Schroeder, M.D., Birrell, A.D., Burrows, M., Murray, H., Needham, R.M., Rodeheffer, T.L., Satterthwate, E.H., Thacker, C.P.: Autonet: a high-speed, self-configuring local area network using point-to-point links. Technical Report 59, Systems Research Center of Digital Equipment Corporation (1990)

    Google Scholar 

  15. Silla, F., Duato, J.: Improving the efficiency of adaptive routing in networks with irregular topology. In: Proceedings of the 1997 Int. Conference on High Performance Computing (HiPC 1997) (December 1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alfaro, F.J., Bermúdez, A., Casado, R., Duato, J., Quiles, F.J., Sánchez, J.L. (2000). On the Performance of Up*/Down* Routing. In: Falsafi, B., Lauria, M. (eds) Network-Based Parallel Computing. Communication, Architecture, and Applications. CANPC 2000. Lecture Notes in Computer Science, vol 1797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720115_5

Download citation

  • DOI: https://doi.org/10.1007/10720115_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67879-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics