This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability
August 2003 (vol. 14 no. 8)
pp. 780-794

Abstract—Network-based parallel computing systems often require the ability to reconfigure the routing algorithm to reflect changes in network topology if and when voluntary or involuntary changes occur. The process of reconfiguring a network's routing capabilities may be very inefficient and/or deadlock-prone if not handled properly. In this paper, we propose efficient and deadlock-free dynamic reconfiguration schemes that are applicable to routing algorithms and networks which use wormhole, virtual cut-through, or store-and-forward switching, combined with hard link-level flow control. One requirement is that the network architecture use virtual channels or duplicate physical channels for deadlock-handling as well as performance purposes. The proposed schemes do not impede the injection, transmission, or delivery of user packets during the reconfiguration process. Instead, they provide uninterrupted service, increased availability/reliability, and improved overall quality-of-service support as compared to traditional techniques based on static reconfiguration.

[1] J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,320-1,331, Dec. 1993.
[2] 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. 1,055–1,067, Oct. 1995.
[3] 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.
[4] K. Malavalliet et al. Fibre Channel Switch Fabric-2 (FC-SW-2) NCITS 321-200x T11/Project 1305-D/Rev 4. 3 Specification, pp. 57-74, Mar. 2000.
[5] M.D. Schroeder, A.D. Birrell, M. Burrows, H. Murray, R.M. Needham, T.L. Rodeheffe, E.H. Satterthwaite, and C.P. Thacker, "Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links," IEEE J. Selected Areas in Comm., vol. 9, no. 8, pp. 1,318-1,335, Oct. 1991.
[6] T.L. Rodeheffer and M.D. Schroeder, Automatic Reconfiuration in Autonet Technial Report 77, SRC Research, Sept. 1991.
[7] D. Teodosiu, J. Baxter, K. Govil, J. Chapin, M. Rosenblum, and M. Horowitz, Hardware Fault Containment in Scalable Shared-Memory Multiprocessors Proc. 24th Int'l Symp. Computer Architecture, pp. 73-84, June 1997.
[8] W.J. Dally, Scalable Switching Fabrics for Internet Routers www.avici.com/technology/whitepapersTSRfabric-White Paper.pdf , 2001.
[9] O. Lysne and J. Duato, Fast Dynamic Reconfiguration in Irregular Networks Proc. 2000 Int'l Conf. Parallel Processing, pp. 449-458, Aug. 2000.
[10] InfiniBand Architecture Specification Volume 1, Release 1.0, InfiniBand Trande Association, Oct. 2000.
[11] N. Boden et al., "Myrinet: A Gigabit-per-Second Local Area Network," IEEE Micro, Feb. 1995, pp. 29-36.
[12] R. Casado, A. Bermudez, J. Duato, F.J. Quiles, and J.L. Sanchez, A Protocol for Deadlock-Free Dynamic Reconfiguration in in High-Speed Local Area Networks IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 2, pp. 115-132, Feb. 2001.
[13] J. Duato and T.M. Pinkston, “A General Theory for Deadlock-Free Adaptive Routing,” IEEE Trans. Parallel and Distributed Systems, (submitted).
[14] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[15] P. Kermani and L. Kleinrock, Virtual Cut-Through: A New Computer Communication Switching Technique Computer Networks, pp. 267-286, 1979.
[16] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Morgan Kauffman, 2003.
[17] T.M. Pinkston, R. Pang, and J. Duato, Single/Double Schemes: Deadlock-Free Dynamic Reconfiguration for Dependable Networks CENG technical report, Dept. of EE-Systems, Univ. of Southern California, Apr. 2002.
[18] C.J. Glass and L.M. Ni, "The Turn Model for Adaptive Routing," Proc. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 278-287, May 1992.
[19] Y. Tamir and G.L. Frazier, "Dynamically-Allocated Multi-Queue Buffers for VLSI Communication Switches," IEEE Trans. Computers, vol. 41, no. 6, pp. 725-737, June 1992.
[20] S.S. Mukherjee et al., "The Alpha 21364 Network Architecture," Proc. 9th Symp. High-Performance Interconnects (HOTI 01), IEEE CS Press, 2001, pp. 113-118.
[21] W. Dally, P. Carvey, and L. Dennison, The Avici Terabit Switch/Router Proc. Hot Interconnects VI Symp., pp. 41-50, Aug. 1998.
[22] T.M. Pinkston and S. Warnakulasuriya, Characterization of Deadlocks in K-Ary N-Cube Networks IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 9, pp 38-49, Sept. 1999.
[23] T.M. Pinkston, Y. Choi, and M. Raksapatcharawong, Architecture and Optoelectronic Implementation of the WARRP Router Proc. 15th Symp. Hot Interconnects, pp. 181-189, Aug. 1997.
[24] S.L. Scott and G.M. Thorson, The Cray T3E Network: Adaptive Routing in a High Performance 3D Torus Proc. Symp. Hot Interconnects IV, pp. 147-156, Aug. 1996.
[25] T.M. Pinkston, “Flexible and Efficient Routing Based on Progressive Deadlock Recovery,” IEEE Trans. Computers, vol. 48, no. 7, pp. 649-669, July 1999.
[26] F. Silla, A. Robles, and J. Duato, Improving Performance of Networks of Workstations by Using Disha Concurrent Proc. Int'l Conf. Parallel Processing, Aug. 1998.
[27] J. Duato, "A Theory of Fault-Tolerant Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 8, pp. 790-802, Aug. 1997.
[28] Y.-J. Suh, B.V. Dao, J. Duato, and S. Yalamanchili, Software Based Fault-Tolerant Oblivious Routing in Pipelined Networks Proc. 1995 Int'l Conf. Parallel Processing, pp. 101-105, Aug. 1995.
[29] N. Natchev, D. Avresky, and V. Shurbanov, Dynamic Reconfiguration in High-Speed Computer Clusters Proc. Int'l Conf. Cluster Computing, pp. 380-387, Oct. 2001.
[30] C.J. Glass and L.M. Ni, "Fault-Tolerant Wormhole Routing in Meshes," Proc. 23rd Int'l Symp. Fault-Tolerant Computing, pp. 240-249, 1993.

Index Terms:
Deadlock-free routing, dependable communication, dynamic reconfiguration, hard link-level flow control, interconnection networks, parallel processing.
Citation:
Timothy Mark Pinkston, Ruoming Pang, Jos? Duato, "Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 8, pp. 780-794, Aug. 2003, doi:10.1109/TPDS.2003.1225057
Usage of this product signifies your acceptance of the Terms of Use.