Skip to main content

Simple Deadlock-Free Dynamic Network Reconfiguration

  • Conference paper
High Performance Computing - HiPC 2004 (HiPC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3296))

Included in the following conference series:

Abstract

Dynamic reconfiguration of interconnection networks is defined as the process of changing from one routing function to another while the network remains up and running. The main challenge is in avoiding deadlock anomalies while keeping restrictions on packet injection and forwarding minimal. Current approaches fall in one of two categories. Either they require the existence of extra network resources like e.g. virtual channels, or their complexity is so high that their practical applicability is limited. In this paper we describe a simple and powerful method for dynamic networks reconfiguration. It guarantees a fast and deadlock-free transition from the old to the new routing function, it works for any topology and between any pair of old and new routing functions, and it guarantees in-order packet delivery when used between deterministic routing functions.

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. InfiniBand Trade Association. InfiniBand Architecture. Specification, vol. 1. Release 1.0a (2001), Available at: http://www.infinibandta.com

  2. 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 12(2), 115–132 (2001)

    Article  Google Scholar 

  3. 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 International Symposium on High-Performance Computer Architecture (2000)

    Google Scholar 

  4. Dally, W.J., Seitz, C.L.: The torus routing chip. Distributed Computing 1, 187–196 (1986)

    Article  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  6. Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks: An Engineering Approach. Morgan Kaufmann Publishers, San Francisco (2003)

    Google Scholar 

  7. Fernández, J., García, J., Duato, J.: A new approach to provide real-time services on high-speed local area networks. In: Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS 2001), April 23–27, pp. 124–124. IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  8. Kermani, P., Kleinrock, L.: Virtual cut-through: A new computer communication switching technique. Computer Networks 3, 267–286 (1979)

    MathSciNet  MATH  Google Scholar 

  9. Lysne, O., Duato, J.: Fast dynamic reconfiguration in irregular networks. In: Proceedings of the 2000 International Conference of Parallel Processing, Toronto (Canada), pp. 449–458. IEEE Computer Society, Los Alamitos (2000)

    Chapter  Google Scholar 

  10. Lysne, O., Pinkston, T.M., Duato, J.: A methodology for developing dynamic network reconfiguration processes. In: 2003 International Conference on Parallel Processing (ICPP 2003), pp. 77–86. IEEE, Los Alamitos (2003)

    Chapter  Google Scholar 

  11. Natchev, N., Avresky, D., Shurbanov, V.: Dynamic reconfiguration in high-speed computer clusters. In: Proceedings of the International Conference on Cluster Computing, pp. 380–387. IEEE Computer Society, Los Alamitos (2001)

    Google Scholar 

  12. Pinkston, T., Pang, R., Duato, J.: Deadlock-free dynamic reconfiguration schemes for increased network dependeability. IEEE Transactions on Parallel and Distributed Systems 14(8), 780–794 (2003)

    Article  Google Scholar 

  13. Rodeheffer, T.L., Schroeder, M.D.: Automatic reconfiguration in Autonet. In: Proceedings of 13th ACM Symposium on Operating Systems Principles, pp. 183–197. Association for Computing Machinery SIGOPS (1991)

    Google Scholar 

  14. Teodosiu, D., Baxter, J., Govil, K., Chapin, J., Rosenblum, M., Horowitz, M.: Hardware fault containment in scalable shared-memory multiprocessors. In: Proceedings of the 24th Annual International Symposium on Computer Architecture (ISCA 1997). Computer Architecture News, vol. 25, 2, pp. 73–84. ACM Press, New York (1997)

    Google Scholar 

  15. Warnakulasuriya, S., Pinkston, T.M.: A formal model of message blocking and deadlock resolution in interconnection networks. IEEE Transactions on Parallel and Distributed Systems 11(3), 212–229 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lysne, O., Montañana, J.M., Pinkston, T.M., Duato, J., Skeie, T., Flich, J. (2004). Simple Deadlock-Free Dynamic Network Reconfiguration. In: Bougé, L., Prasanna, V.K. (eds) High Performance Computing - HiPC 2004. HiPC 2004. Lecture Notes in Computer Science, vol 3296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30474-6_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30474-6_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24129-4

  • Online ISBN: 978-3-540-30474-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics