This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies
September 2001 (vol. 50 no. 9)
pp. 865-876

Abstract—A great deal of work has been done recently on developing techniques for proving deadlock freedom for wormhole routing algorithms. One approach has been to restrict the class of routing algorithms for which the proof technique applies. The other approach is to provide a generic method that can be applied to all routing algorithms. Although this latter approach offers clear advantages, a general technique must deal with many complications. Foremost among these is the issue of irreducible cyclic dependencies that cannot result in deadlock. Such dependencies have been referred to alternatively as unreachable configurations and false resource cycles. In this paper, we apply the notion of unreachable cyclic configurations to oblivious routing algorithms. An oblivious routing algorithm is thus constructed that is deadlock-free, even though there are cycles in the channel dependency graph. The idea of unreachable configurations is then further developed to show various restrictions on when such configurations can exist with oblivious routing algorithms. Finally, the example is generalized to allow the construction of larger networks with unreachable cycles. One benefit of characterizing when unreachable cyclic configurations can occur is that proving deadlock freedom is simplified for networks in which unreachable cycles cannot exist. Another contribution of this work is a first step toward a more formal model of unreachable cycles in wormhole-routed networks.

[1] 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.
[2] P. Berman, L. Gravano, J. Sanz, and G. Pifarre, "Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks," Proc. Fourth ACM Symp. Parallel Algorithms and Architectures, June 1992.
[3] Y.M. Boura and C.R. Das, “A Class of Partially Adaptive Routing Algorithms for n_dimensional Meshes,” Proc. Int'l Conf. Parallel Processing, vol. III, pp. 175-182, Aug. 1993.
[4] A.A. Chien, “A Cost and Speed Model for k-Ary n-Cube Wormhole Routers,” Proc. Hot Interconnects '93, Aug. 1993.
[5] R. Cypher and L. Gravano, "Requirements for Deadlock-Free, Adaptive Packet Routing," Proc. 11th ACM Symp. Principles Distributed Computing, 1992.
[6] R. Cypher and L. Gravano, “Requirements for Deadlock-Free, Adaptive Packet Routing,” SIAM J. Computing, vol. 23, no. 6, pp. 1266-1274, Dec. 1994.
[7] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[8] 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.
[9] 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.
[10] J. Duato, “On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies,” Proc. Parallel Architectures and Languages Europe 91, June 1991.
[11] 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.
[12] J. Duato, “A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks,” Proc. Int'l Conf. Parallel Processing, vol. I, pp. 142-149, Aug. 1994.
[13] 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.
[14] N. Boden et al., "Myrinet: A Gigabit-per-Second Local Area Network," IEEE Micro, Feb. 1995, pp. 29-36.
[15] E. Fleury and P. Fraigniaud, “Deadlocks in Adaptive Wormhole Routing,” Technical Report RR94-09, Laboratoire de l'Informatique du Parallélisme, LIP, Ecole Normale Supérieure de Lyon, Mar. 1994.
[16] E. Fleury and P. Fraigniaud, “Deadlock Avoidance in Wormhole-Routed Networks,” Proc. 10th Int'l Conf. Parallel and Distributed Computing Systems, pp. 378-384, Oct. 1997.
[17] E. Fleury and P. Fraigniaud, “A General Theory for Deadlock Avoidance in Wormhole-Routed Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 7, pp. 626-638, July 1998.
[18] P.T. Gaughan and S. Yalamanchili, “Adaptive Routing Protocols for Hypercube Interconnection Networks,” Computer, vol. 26, no. 5, pp. 12–23, May 1993.
[19] 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.
[20] D.N. Jayasimha, D. Manivannan, J.A. May, L. Schwiebert, and S.L. Hary, “A Foundation for Designing Deadlock-Free Routing Algorithms in Wormhole Networks,” Proc. Symp. Parallel and Distributed Processing, pp. 190-197, Oct. 1996.
[21] P. Kermani and L. Kleinrock, “Virtual Cut-Through: A New Computer Communication Switching Technique,” Computer Networks, vol. 3, no. 4, pp. 267-286, Sept. 1979.
[22] X. Lin, P.K. McKinley, and L.M. Ni, “The Message Flow Model for Routing in Wormhole-Routed Networks,” Proc. Int'l Conf. Parallel Processing, vol. I, pp. 294-297, Aug. 1993.
[23] X. Lin, P.K. McKinley, L.M. Ni, “The Message Flow Model for Routing in Wormhole-Routed Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 7, pp. 755–760, July 1995.
[24] 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.
[25] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[26] 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.
[27] T.M. Pinkston, “Flexible and Efficient Routing Based on Progressive Deadlock Recovery,” IEEE Trans. Computers, vol. 48, no. 7, pp. 649-669, July 1999.
[28] 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.
[29] L. Schwiebert and D.N. Jayasimha, “Optimal Fully Adaptive Wormhole Routing for Meshes,” Proc. Supercomputing '93, pp. 782-791, Nov. 1993.
[30] L. Schwiebert and D.N. Jayasimha, “A Universal Proof Technique for Deadlock-Free Routing in Interconnection Networks,” Proc. Symp. Parallel Algorithms and Architectures, pp. 175–184, July 1995.
[31] L. Schwiebert and D.N. Jayasimha, “Optimally Fully Adaptive Minimal Wormhole Routing for Meshes,” J. Parallel and Distributed Computing, vol. 27, pp. 56-70, 1995.
[32] 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.

Index Terms:
Wormhole routing, deadlock freedom, oblivious routing, channel dependency graph, unreachable configuration.
Citation:
Loren Schwiebert, "Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies," IEEE Transactions on Computers, vol. 50, no. 9, pp. 865-876, Sept. 2001, doi:10.1109/12.954503
Usage of this product signifies your acceptance of the Terms of Use.