This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Characterization of Deadlocks in k-ary n-Cube Networks
September 1999 (vol. 10 no. 9)
pp. 904-921

Abstract—A spate of deadlock avoidance-based and deadlock recovery-based routing algorithms have been proposed in recent years without full understanding of the likelihood and characteristics of actual deadlocks in interconnection networks. This work models the interrelationships between routing freedom, message blocking, correlated resource dependencies, and deadlock formation. It is empirically shown that increasing routing freedom, as achieved by allowing unrestricted routing over multiple physical and virtual channels, reduces the probability of deadlocks and the likelihood of other types of correlated message blocking that can degrade performance. Moreover, when true fully adaptive routing is used in $k$-ary $n$-cube networks with two or more virtual channels (wormhole or virtual cut-through switched), it is empirically shown that deadlocks are virtually eliminated in networks with $n \geq 2$. These results indicate that deadlocks are very infrequent when the network and routing algorithm inherently provide sufficient routing freedom, thus increasing the viability of deadlock recovery routing strategies.

[1] A.A. Chien and J.H. Kim, "Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors," Proc. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 268-277, May 1992.
[2] 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.
[3] 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.
[4] J.H. Kim, Z. Liu, and A.A. Chien., "Compressionless Routing: A Framework for Fault-Tolerant Routing," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 3, pp. 229-244, Mar. 1997.
[5] K.V. Anjan and T.M. Pinkston, “An Efficient, Fully Adaptive Deadlock Recovery Scheme: Disha,” Proc. 22nd Ann. Int'l Symp. Computer Architecture, pp. 201-210, June 1995.
[6] K.V. Anjan, T.M. Pinkston, and J. Duato, Generalized Theory for Deadlock-Free Adaptive Routing and Its Application to Disha Concurrent Proc. 10th Int'l Parallel Processing Symp., Apr. 1996.
[7] P. Palazzari and M. Coli, “Virtual Cut-Through Implementation of the Hole-Based Packet Switching Routing Algorithm,” Proc. Sixth Euromicro Workshop Parallel and Distributed Processing, pp. 416-421, Jan. 1998.
[8] 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.
[9] L. Schwiebert and D.N. Jayasimha, "A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing," J. Parallel and Distributed Computing, vol. 32, no. 1, pp. 103-117, Jan. 1996.
[10] S. Warnakulasuriya, “Characterization of Deadlocks in Interconnection Networks,” PhD thesis, Univ. of Southern California, 1999.
[11] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[12] R.C. Holt, “Some Deadlock Properties of Computer Systems,” ACM Computing Surveys, vol. 4, no. 3, pp. 179-195, 1972.
[13] E. Knapp, "Deadlock Detection in Distributed databases Systems," ACM Computing Surveys, pp. 303-328, Dec. 1987.
[14] S. Warnakulasuriya and T.M. Pinkston, “Characterization of Deadlocks in Interconnection Networks,” Proc. 11th Int'l Parallel Processing Symp., Apr. 1997.
[15] T.M. Pinkston and S. Warnakulasuriya, “On Deadlocks in Interconnection Networks,” Proc. 24th Int'l Symp. Computer Architecture, June 1997.
[16] 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.
[17] W.J. Dally and H. Aoki, "Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 466-475, Apr. 1993.
[18] S. Warnakulasuriya and T.M. Pinkston, “Modelling Message Blocking and Deadlock in Interconnection Networks,” Proc. Second PCRCW, pp. 239-257, June 1997.
[19] J.M. Martínez, P. López, J. Duato, and T.M. Pinkston, “Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks,” Proc. Int'l Conf. Parallel Processing, pp. 182-189, Aug. 1997.
[20] P. Kermani and L. Kleinrock, “Virtual Cut-Through: A New Computer Communication Switching Technique,” Computer Networks, pp. 267-286, 1979.
[21] C. Stunkel, D. Shea, B. Abali, M. Atkins, C. Bender, D. Grice, P. Hochshild, D. Joseph, B. Nathanson, R. Swetz, R. Stucke, M. Tsao, and P. Varker, “The SP2 High-Performance Switch,” IBM Systems J., vol. 34, no. 2,pp. 185–204, 1995.
[22] P. López, J.M. Martínez, and J. Duato, A Very Efficient Distributed Deadlock Detection Mechanism for Wormhole Networks Proc. High Performance Computer Architecture Symp., Feb. 1998.
[23] F. Petrini and M. Vanneschi, “Performance Analysis of Minimal Adaptive Wormhole Routing with Time-Dependent Deadlock Recovery,” Proc. 11th Int'l Parallel Processing Symp., pp. 589-595, Apr. 1997.
[24] T.M. Pinkston, “Flexible and Efficient Routing Based on Progressive Deadlock Recovery,” IEEE Trans. Computers, vol. 48, no. 7, pp. 649-669, July 1999.
[25] S. Konstantinidou and L. Snyder, "Chaos Router: Architecture and Performance," Proc. 18th Ann. Int'l Symp. Computer Architecture, 1991.
[26] N. McKenzie, K. Bolding, C. Ebeling, and L. Snyder, “ChaosLAN: Design and Implementation of a Gigabit LAN Using Chaotic Routing,” Proc. Second PCRCW, pp. 211-223, June 1997.
[27] D. Reeves, E. Gehringer, and A. Chandiramani, “Adaptive Routing and Deadlock Recovery: A Simulation Study,” Proc. Fourth Conf. Hypercube Concurrent Computers and Applications, Mar. 1989.
[28] A. Kshemkalyani and M. Singhal, “On Characterization and Correctness of Distributed Deadlock Detection,” J. Parallel and Distributed Computing, vol. 22, no. 1, pp. 44-59, July 1994.
[29] K.M. Chandy and J. Misra, "A Distributed Graph Algorithm: Knot Detection," ACM Trans. Program Language Systems, vol. 4, pp. 678-686, Oct. 1982.
[30] I. Cidon, "An Efficient Distributed Knot Detection Algorithm," IEEE Trans. Software Eng., vol. 15, no. 5, pp. 644-649, May 1989.
[31] A.D. Kshemkalyani and M. Singhal, "Efficient Detection and Resolution of Generalized Distributed Deadlocks," IEEE Trans. Software Eng., vol. 20, no. 1, pp. 43-54, Jan. 1994.
[32] P. López and J. Duato,“Deadlock-free adaptive routing algorithms for the 3D-torus:Limitations and solutions,” Proc. Parallel Architectures Languages Europe 93, June 1993.

Index Terms:
Deadlock characterization, deadlock detection, deadlock recovery, true fully adaptive routing, $k$-ary $n$-cube interconnection networks.
Citation:
Timothy Mark Pinkston, Sugath Warnakulasuriya, "Characterization of Deadlocks in k-ary n-Cube Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 9, pp. 904-921, Sept. 1999, doi:10.1109/71.798315
Usage of this product signifies your acceptance of the Terms of Use.