Publication 2005 Issue No. 5 - May Abstract - Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Olav Lysne Articles by Timothy Mark Pinkston Articles by Jos? Duato
Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes
May 2005 (vol. 16 no. 5)
pp. 428-443
 ASCII Text x Olav Lysne, Timothy Mark Pinkston, Jos? Duato, "Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 5, pp. 428-443, May, 2005.
 BibTex x @article{ 10.1109/TPDS.2005.59,author = {Olav Lysne and Timothy Mark Pinkston and Jos? Duato},title = {Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {16},number = {5},issn = {1045-9219},year = {2005},pages = {428-443},doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.59},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration ProcessesIS - 5SN - 1045-9219SP428EP443EPD - 428-443A1 - Olav Lysne, A1 - Timothy Mark Pinkston, A1 - Jos? Duato, PY - 2005KW - Interconnection networkKW - dynamic reconfigurationKW - deadlock-freedom methodologyKW - system reliability and availability.VL - 16JA - IEEE Transactions on Parallel and Distributed SystemsER -

Abstract—Dynamic network reconfiguration 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 either require virtual channels in the network or they work only for a limited set of routing algorithms and/or fault patterns. In this paper, we present a methodology for devising deadlock free and dynamic transitions between old and new routing functions that is consistent with newly proposed theory [CHECK END OF SENTENCE]. The methodology is independent of topology, can be applied to any deadlock-free routing function, and puts no restrictions on the routing function changes that can be supported. Furthermore, it does not require any virtual channels to guarantee deadlock freedom. This research is motivated by current trends toward using increasingly larger Internet and transaction processing servers based on clusters of PCs that have very high availability and dependability requirements, as well as other local, system, and storage area network-based computing systems.

[1] J. Duato, O. Lysne, R. Pang, and T.M. Pinkston, “Part I: A Theory for Deadlock-free Dynamic Network Reconfiguration,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 5, pp. 412-427, 2005.
[2] P. Kermani and L. Kleinrock, “Virtual Cut-Through: A New Computer Communication Switching Technique,” Computer Networks, vol. 3, pp. 267-286, 1979.
[3] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, vol. 36, no. 5, pp. 547-553, May 1987.
[4] W.J. Dally, “Virtual-Channel Flow Control,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[5] J. Duato, “A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 10, pp. 1055-1067, 1995.
[6] J. Duato, “A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 8, pp. 841-854, 1996.
[7] J. Duato, S. Yalamanchili, and L. Ni, Interconnection Networks: An Engineering Approach. IEEE CS Press, 1997.
[8] J. Duato and T.M. Pinkston, “A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 12, pp. 1219-1235, Dec. 2001.
[9] K. Gharachorloo, M. Sharma, S. Steely, and S. Van Doren, “Architecture and Design of AlphaServer GS320,” ACM SIG-PLAN Notices, vol. 35, no. 11, pp. 13-24, Nov. 2000.
[10] W. Barrett et al., “An Overview of the Blue-Gene/L Supercomputer,” Proc. ACM/IEEE Conf. Supercomputing, CD-ROM, Nov. 2002.
[11] D. Garcia and W. Watson, “ServerNet${^{\rm TM}}$ II,” Lecture Notes in Computer Science, vol. 1417, pp. 119-135, 1998.
[12] InfiniBand Trade Association, InfiniBand Architecture, Specification Volume 1, Release 1.0a, http:/www.infinibandta.com, 2001.
[13] M.D. Schröder et al., “Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links,” SRC Research Report 59, Digital Equipment Corporation, 1990.
[14] F. Petrini, W.-C. Feng, A. Hoisie, S. Coll, and E. Frachtenberg, “The Quadrics Network: High-Performance Clustering Technology,” IEEE Micro, vol. 22, no. 1, pp. 2-13, Jan.-Feb. 2002.
[15] Inc. Myrinet, Guide to Myrinet-2000 Switches and Switch Networks, http:/www.myri.com, Aug. 2001.
[16] O. Feuser and A. Wenzel, “On the Effects of the IEEE 802. 3x Flow Control in Full-Duplex Ethernet LANs,” Proc. 24th Conf. Local Computer Networks, pp. 160-161, 1999.
[17] T.L. Rodeheffer and M.D. Schroeder, “Automatic Reconfiguration in Autonet,” Proc. 13th ACM Symp. Operating Systems Principles, ACM SIGOPS, pp. 183-197, Oct. 1991.
[18] D. Teodosiu, J. Baxter, K. Govil, J. Chapin, M. Rosenblum, and M. Horowitz, “Hardware Fault Containment in Scalable Shared-Memory Multiprocessors,” Proc. 24th Ann. Int'l Symp. Computer Architecture, vol. 25, no. 2, pp. 73-84, 1997.
[19] S. Warnakulasuriya and T.M. Pinkston, “A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 2, pp. 212-229, Mar. 2000.
[20] A. Bermúdez, R. Casado, F.J. Quiles, T.M. Pinkston, and J. Duato, “On the Infiniband Subnet Discovery Process,” Proc. Int'l Cluster Computing Conf., Dec. 2003.
[21] R. Casado, A. Bermúdez, J. Duato, F.J. Quiles, and J.L. Sánchez, “A Protocol for Deadlock-Free Dynamic Reconfiguration in High-Speed Local Area Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 2, pp. 115-132, Feb. 2001.
[22] T.M. Pinkston, R. Pang, and J. Duato, “Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 8, pp. 780-794, Aug. 2003.
[23] O. Lysne and J. Duato, “Fast Dynamic Reconfiguration in Irregular Networks,” Proc. Int'l Conf. Parallel Processing, pp. 449-458, 2000.
[24] B. Zafar, T.M. Pinkston, A. Bermudez, and J. Duato, “Deadlock-Free Dynamic Reconfiguration over InfiniBand Networks,” J. Parallel Algorithms and Applications vol. 19, nos. 2-3, pp. 127-143, June-Sept. 2004.
[25] C.J. Glass and L.M. Ni, “The Turn Model for Adaptive Routing,” J. ACM, vol. 41, no. 5, pp. 874-902, 1994.

Index Terms:
Interconnection network, dynamic reconfiguration, deadlock-freedom methodology, system reliability and availability.
Citation:
Olav Lysne, Timothy Mark Pinkston, Jos? Duato, "Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 5, pp. 428-443, May 2005, doi:10.1109/TPDS.2005.59