Advertisement

Deadlock-Free Routing in Irregular Networks with Dynamic Reconfiguration

  • Rafael Casado
  • Francisco J. Quiles
  • José L. Sánchez
  • José Duato
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1602)

Abstract

High-speed local area networks (LANs) support many distributed applications. These applications require some system availability guarantees. However, LANs may change their topology due to switches and hosts being turned on/off, link remapping, and component failures. In these cases, a distributed reconfiguration algorithm is executed. This algorithm analyzes the topology, computes the new routing tables, and downloads them to the corresponding switches. Unfortunately, in most cases user traffic is stopped during the reconfiguration process to avoid deadlock. Although network reconfigurations are not frequent, they may take hundreds of milliseconds to execute, thus degrading system availability significantly. In this paper, we propose a new deadlock-free distributed reconfiguration algorithm that is able to asynchronously update the routing tables without stopping user traffic. This dynamic reconfiguration algorithm is valid for any topology, including regular as well as irregular topologies.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Schroeder, M.D., et al.: Autonet: A high-speed, selfconfiguring local area network using point-to-point links. IEEE Journal on Selected Areas in Communications 9(8) (October 1991)Google Scholar
  2. 2.
    Felderman, R.E., et al.: Atomic: A High Speed Local Communication Architecture. J. High Speed Networks 3(1), 1–29 (1994)Google Scholar
  3. 3.
    Boden, N., et al.: Myrinet: A gigabit per second LAN. IEEE Micro (February 1995)Google Scholar
  4. 4.
    Horst, R.W.: Tnet: A reliable system area network. IEEE Micro (February 1995)Google Scholar
  5. 5.
    Rodeheffer, T.L., Schroeder, M.D.: Automatic Reconfiguration in Autonet. SRC Research Report 77, September 18 (1991)Google Scholar
  6. 6.
    Owicki, S.S., Karlin, A.R.: Factors in the performance of AN1 Computer Network. SRC Research Report 88 (June 1992) Google Scholar
  7. 7.
    Knightly, E.W., Zhang, H.: D-BIND: An accurate traffic model for providing QoS guarantees to VBR traffic. IEEE Trans. on Networking 5(2) (April 1995)Google Scholar
  8. 8.
    Pfister, G.F.: In search of clusters. Prentice Hall, Englewood (1995)zbMATHGoogle Scholar
  9. 9.
    Pakin, S., Lauria, M., Chien, A.: High performance messaging on workstations: Illinois fast messages on Myrinet. Supercomputing 95 (November 1995)Google Scholar
  10. 10.
    Casado, R., Caminero, M.B., Cuenca, P., Quiles, F.J., Garrido, A., Duato, J.: A tool for the analysis of reconfiguration and routing algorithms in irregular networks. In: Panda, D.K., Stunkel, C.B. (eds.) CANPC 1998. LNCS, vol. 1362, pp. 159–173. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  11. 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 (August 1996)Google Scholar
  12. 12.
    Silla, F., Malumbres, M.P., Robles, A., López, P., Duato, J.: Efficient Adaptive Routing in Networks of Workstations with Irregular Topology. In: Workshop on Communications and Architectural Support for Network-based Parallel Computing (February 1997)Google Scholar
  13. 13.
    Silla, F., Duato, J.: Improving the efficiency of adaptive routing in networks with irregular topology. In: International Conference on High Performance Computing (December 1997)Google Scholar
  14. 14.
    Abali, B.: A Deadlock Avoidance Method for Computer Networks. In: Panda, D.K., Stunkel, C.B. (eds.) CANPC 1997. LNCS, vol. 1199. Springer, Heidelberg (1997)Google Scholar
  15. 15.
    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
  16. 16.
    Perlman, R.: An algorithm for distributed computation on a spanning tree in a extended LAN. In: Ninth Data Common Symp. Whistler Mountain, British Columbia, September 10-13, pp. 44–53 (1985)Google Scholar
  17. 17.
    Casado, R., Quiles, F.J., Sánchez, J.L., Duato, J.: An Efficient Protocol for Dynamic Reconfiguration in Irregular Networks. Technical Report. TR-DI1-UCLM98Google Scholar
  18. 18.
  19. 19.
    Duato, J.: A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Trans. on Parallel and Distributed Systems 4(12), 1320–1331 (1993)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Rafael Casado
    • 1
  • Francisco J. Quiles
    • 1
  • José L. Sánchez
    • 1
  • José Duato
    • 2
  1. 1.Dept. of Computer Science, Escuela Politécnica Superior de AlbaceteUniversidad de Castilla-La ManchaAlbaceteSpain
  2. 2.Dept. of Information Systems and Computer ArchitectureUniversidad Politécnica de ValenciaValenciaSpain

Personalised recommendations