Network Reconfiguration in High-Performance Interconnection Networks

  • R. Casado
  • A. Bermúdez
  • A. Robles-Gómez
  • O. Lysne
  • T. Skeie
  • Å.G. Solheim
  • T. Sødring


High-performance interconnection networks such as InfiniBand, ASI, Autonet, and Myrinet have the property of link level flow control. As such, alterating the routing function while the network is operational is a complex process, because the danger of packet deadlocks must be addressed. Over the past 5–6 years this problem has been addressed and solved by the research community.

This chapter collects several proposals for updating a routing function in interconnection networks after the occurrence of a topological change. Both traditional and recent reconfiguration schemes are covered, and the selection includes both technology-dependent and generic techniques.


Span Tree Output Channel Virtual Channel Router Node Forwarding Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.



This work has been jointly supported by the Spanish MEC and European Comission FEDER funds under grants “Consolider Ingenio-2010 CSD2006-00046” and “TIN2006-15516-C04-02”; by JCCM under grant “PBC05-007-1.” It has also been supported by a FPI grant under the Spanish MEC “TIC2003-08154-C06-02.”


  1. 1.
    Bermúdez, A., Casado, R., Quiles, F.J.: Distributing InfiniBand forwarding tables. In: Euro-Par 2004 Conference, pp. 864–872. Pisa, Italy (2004)Google Scholar
  2. 2.
    Bermúdez, A., Casado, R., Quiles, F.J., Pinkston, T.M.: Evaluation of a subnet management mechanism for InfiniBand networks. In: 2003 International Conference on Parallel Processing (ICPP’03), pp. 117–124. IEEE Society Press (2003)Google Scholar
  3. 3.
    Boden, N.J., Cohen, D., Felderman, R.E., Kulawik, A.E., Seitz, C.L., Seizovic, J.N., Su, W.: Myrinet: A Gigabit-per-Second Local Area Network. IEEE Micro 15(1) (1995)Google Scholar
  4. 4.
    Casado, R., Bermúdez, A., Duato, J., Quiles, F.J., Sánchez, J.L.: A protocol for deadlock-free dynamic reconfiguration in high-speed local area networks. IEEE Transactions on Parallel and Distributed Systems (TPDS) 12(2), 115–132 (2001)CrossRefGoogle Scholar
  5. 5.
    Dally, W.J., Seitz, C.L.: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers C-36(5), 547–553 (1987)CrossRefGoogle Scholar
  6. 6.
    Duato, J.: A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. IEEE Transactions on Parallel and Distributed Systems (TPDS) 6(10), 1055–1067 (1995)CrossRefGoogle Scholar
  7. 7.
    Duato, J.: A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks. IEEE Transactions on Parallel and Distributed Systems (TPDS) 7(8), 841–854 (1996)CrossRefGoogle Scholar
  8. 8.
    Duato, J., Lysne, O., Pang, R., Pinkston, T.M.: Part I: A theory for deadlock-free dynamic network reconfiguration. IEEE Transactions on Parallel Distributed Systems (TPDS) 16(5), 412–427 (2005)CrossRefGoogle Scholar
  9. 9.
    Duato, J., Pinkston, T.M.: A general theory for deadlock-free adaptive routing using a mixed set of resources. IEEE Transactions on Parallel and Distributed Systems (TPDS) 12(12), 1219–1235 (2001)CrossRefGoogle Scholar
  10. 10.
    Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks: An Engineering Approach. Morgan Kaufmann Publishers (2002)Google Scholar
  11. 11.
    Lysne, O., Montañana, J.M., Flich, J., Duato, J., Pinkston, T.M., Skeie, T.: An efficient and deadlock-free network reconfiguration protocol. IEEE Transactions on Computers 57(6), 762–779 (2008)CrossRefGoogle Scholar
  12. 12.
    Lysne, O., Montañana, J.M., Pinkston, T.M., Duato, J., Skeie, T., Flich, J.: Simple deadlock-free dynamic network reconfiguration. In: 11th International Conference on High Performance Computing (HiPC 2004), pp. 504–515 (2004)Google Scholar
  13. 13.
    Lysne, O., Skeie, T., Reinemo, S.A., Theiss, I.: Layered routing in irregular networks. IEEE Transactions on Parallel and Distributed Systems 17(1), 51–65 (2006)CrossRefGoogle Scholar
  14. 14.
    Pang, R., Pinkston, T.M., Duato, J.: The double scheme: Deadlock-free dynamic reconfiguration of cut-through networks. In: Proceedings of the 2000 International Conference on Parallel Processing (ICPP’00), pp. 439–448 (2000)Google Scholar
  15. 15.
    Robles-Gómez, A., Bermúdez, A., Casado, R., Solheim, ÅA.G.: Deadlock-free dynamic network reconfiguration based on close up*/down* graphs. In: Euro-Par 2008 Conference pp. 940–949 (2008)Google Scholar
  16. 16.
    Rodeheffer, T.L., Schroeder, M.D.: Automatic reconfiguration in autonet. In: SRC Research Report 77 of the ACM Symposium on Operating Systems Principles (1991)Google Scholar
  17. 17.
    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. IEEE Journal on Selected Areas in Communications 9(8), (1991)Google Scholar
  18. 18.
    Zafar, B., Pinkston, T.M., Bermúdez, A., Duato, J.: Deadlock-free dynamic reconfiguration over InfiniBand. Special Issue on Parallel and Distributed Algorithms, International Journal of Parallel Algorithms and Applications (IJPAA) 19(2–3), 127–143 (2004)MATHGoogle Scholar

Copyright information

© Springer-Verlag US 2009

Authors and Affiliations

  • R. Casado
    • 1
  • A. Bermúdez
    • 1
  • A. Robles-Gómez
    • 1
  • O. Lysne
    • 2
  • T. Skeie
    • 2
  • Å.G. Solheim
    • 2
  • T. Sødring
    • 2
  1. 1.Universidad de Castilla-La Mancha02071 AlbaceteSpain
  2. 2.University of Oslo, Simula Research LaboratoryN-1325 LysakerNorway

Personalised recommendations