
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Rajendra V. Boppana, Suresh Chalasani, "A Framework for Designing DeadlockFree Wormhole Routing Algorithms," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 2, pp. 169183, February, 1996.  
BibTex  x  
@article{ 10.1109/71.485506, author = {Rajendra V. Boppana and Suresh Chalasani}, title = {A Framework for Designing DeadlockFree Wormhole Routing Algorithms}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {2}, issn = {10459219}, year = {1996}, pages = {169183}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.485506}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A Framework for Designing DeadlockFree Wormhole Routing Algorithms IS  2 SN  10459219 SP169 EP183 EPD  169183 A1  Rajendra V. Boppana, A1  Suresh Chalasani, PY  1996 KW  Adaptive routing KW  Cayley networks KW  de Bruijn networks KW  deadlocks KW  design techniques KW  multicomputer networks KW  mesh networks KW  performance evaluation KW  wormhole routing. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—This paper presents a framework to design fullyadaptive, deadlockfree wormhole algorithms for a variety of network topologies. The main theoretical contributions are (a) design of new wormhole algorithms using storeandforward algorithms, (b) a sufficient condition for deadlock free routing by the wormhole algorithms so designed, and (c) a sufficient condition for deadlock free routing by these wormhole algorithms with centralized flit buffers shared among multiple channels. To illustrate the theory, several wormhole algorithms based on storeandforward hop schemes are designed. The hopbased wormhole algorithms can be applied to a variety of networks including torus, mesh, de Brujin, and a class of Cayley networks, with the best known bounds on virtual channels for minimal routing on the last two classes of networks. An analysis of the resource requirements and performances of a proposed algorithm, called negativehop algorithm, with some of the previously proposed algorithms for torus and mesh networks is presented.
[1] A. Agarwal et al., “The MIT Alewife Machine: Architecture and Performance,” Proc. Int'l Symp. Computer Architecture, pp. 213, June 1995.
[2] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[3] R. Alverson et al., "The Tera Computer System," Proc. Int'l Conf. Supercomputing, Assoc. of Computing Machinery, N.Y., 1990, pp. 16.
[4] P. Berman, L. Gravano, J. Sanz, and G. Pifarre, "Adaptive Deadlock and LivelockFree Routing with All Minimal Paths in Torus Networks," Proc. Fourth ACM Symp. Parallel Algorithms and Architectures, June 1992.
[5] K. Bolding and L. Snyder, "Mesh and torus chaotic routing," Proc. Advanced Research in VLSI and Parallel Systems, 1992.
[6] R. Boppana and S. Chalasani, "A Comparison of Adaptive Wormhole Routing Algorithms," Proc. 20th Ann. Int'l Symp. Computer Architecture," pp. 351360, 1993.
[7] S. Borkar, R. Cohn, G. Cox, S. Gleason, T. Gross, H.T. Kung, M. Lam, B. Moore, C. Peterson, J. Pieper, L. Rankin, P.S. Tseng, J. Sutton, J. Urbanski, and J. Webb iWarp: An Integrated Solution to HighSpeed Parallel Computing, Proc. 1988 Int'l Conf. Supercomputing, pp. 330339., IEEE CS and ACM SIGARCH, Orlando, Fla., Nov. 1988.
[8] A.A. Chien, "A cost and speed model for kary ecube wormhole routers." Presented at Hot Interconnects 1993, Mar. 1993.
[9] A.A. Chien and J.H. Kim, "PlanarAdaptive Routing: LowCost Adaptive Networks for Multiprocessors," Proc. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 268277, May 1992.
[10] R. Cypher and L. Gravano, "Adaptive, deadlockfree packet routing in torus networks with minimal storage," Proc. 1992 Int'l Conf. on Parallel Processing, pp. III204 to III211, 1992.
[11] W.J. Dally, "VirtualChannel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194205, Mar. 1992.
[12] W.J. Dally and H. Aoki, "DeadlockFree Adaptive Routing in Multicomputer Networks Using Virtual Channels," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 466475, Apr. 1993.
[13] W.J. Dally and C.L. Seitz, “DeadlockFree Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C36, No. 5, May 1987, pp. 547553.
[14] J. Duato, "A New Theory of DeadlockFree Adaptive Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,3201,331, Dec. 1993.
[15] J. Duato and P. López, "Performance Evaluation of Adaptive Routing Algorithms for kary ncubes," Proc. Workshop Parallel Computer Routing and Communication, May. 1994.
[16] S. Felperin, L. Gravano, G. Pifarre, and J. Sanz, "Fullyadaptive routing: Packet switching performance and wormhole algorithms," Proc. Supercomputing '91, pp. 654663, 1991.
[17] S.A. Felperim,L. Gravana,G.D. Pifarre,, and J.L.C. Sanz,“Routing techniques for massively parallel communication,” Proc. IEEE, vol. 791, no. 4, pp. 488503, Apr. 1991.
[18] E. Ganeshan and D. K. Pradhan, "Wormhole routing in de Bruijn networks," Tech. Rep., Texas A&M University, Dept. of Computer Science, College Station, Texas, Dec. 1992.
[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. 278287, May 1992.
[20] I.S. Gopal, "Prevention of StoreandForward Deadlock in Computer Networks," IEEE Trans. Commun., vol. 33, no. 12, pp. 1,2581,264, Dec. 1985.
[21] T. Gross, "Communication in iWarp systems," Proc. Supercomputing '89, pp. 436445, 1989.
[22] K.D. Gunther, "Prevention of Deadlocks in PacketSwitched Data Transport Systems," IEEE Trans. Commun., vol. 29, pp. 512524, Apr. 1981.
[23] F. Harary, Graph Theory. AddisonWesley, 1969.
[24] I.N. Herstein, Topics in Algebra. JohnWiley and Sons, second ed., 1975.
[25] T Hone, H. Ishihata, and M. Ikesaka, "Design and implementation of an interconnection network for the AP 1000," Algorithms, Software Architecture, vol. 1, pp. 555561, Elsevier Science B.V., 1992. Information Processing 92.
[26] R. Jain, The Art of Computer Systems Performance Analysis. John Wiley&Sons, Inc., 1991.
[27] P. Kermani and L. Kleinrock, "Virtual cutthrough: A new computer communication switching technique," Computer Networks, vol. 3, pp. 267286, 1979.
[28] S. Konstantinidou and L. Snyder, "Chaos Router: Architecture and Performance," Proc. 18th Ann. Int'l Symp. Computer Architecture, 1991.
[29] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[30] S.L. Lillevik,“The Touchstone 30 Gigaflop DELTA prototype,” Sixth Distributed Memory Computing Conf., pp. 671677, 1991.
[31] D.H. Linder and J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for kAry nCubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 212, Jan. 1991.
[32] M.D. Noakes, D.A. Wallach, and W.J. Dally, "The JMachine Multicomputer: An Architectural Evaluation," Proc. 20th Ann. Int'l Symp. Computer Architecture, pp. 224235, May 1993.
[33] J. Misic, "Multicomputer interconnection network based on a star graph, Proc. 24th Hawaii Int'l Conf. on System Sciences, vol. 2, pp. 373381, 1991.
[34] J.Y. Ngai and C.L. Seitz, "A Framework For Adaptive Routing in Multicomputer Networks," Proc. ACM Symp. Parallel Algorithms Architectures, 1989.
[35] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 6276, Feb. 1993.
[36] W. Oed, "The Cray research massively parallel processor system, CRAY T3D," Tech. Rep., Cray Research Inc., Nov. 1993.
[37] H. Park and D.P. Agrawal, "A novel deadlockfree routing technique for a class of de Bruijn graph based networks," Proc. 9th Int'l Parallel Processing Symp., 1995.
[38] G.D. Pifarré, L. Gravano, S.A. Felperin, and J.L.C. Sanz, "Fully Adaptive Minimal DeadlockFree Packet Routing in Hypercubes, Meshes and Other Networks: Algorithms and Simulations," IEEE Trans. Parallel Distributed Systems, vol. 5, no. 3, pp. 247263, Mar. 1994.
[39] M.R. Samatham and D.K. Pradhan, "The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI," IEEE Trans. Computers, vol. 38, no. 4, pp. 567581, Apr. 1989.
[40] L. Schwiebert and D.N. Jayasimha, “Optimal Fully Adaptive Wormhole Routing for Meshes,” Proc. Supercomputing '93, pp. 782791, Nov. 1993.
[41] C.L. Seitz, "Concurrent architectures," VLSI and Parallel Computation, R. Suaya and G. Birtwistle, eds., ch. 1, pp. 184.San Mateo, Calif.: MorganKaufman Publishers, Inc., 1990.
[42] C.B. Stunkel, D.G. Shea, B. Abali, M.M. Denneau, P.H. Hochschild, D.J. Joseph, B.J. Nathanson, M. Tsao, and P.R. Varker, “Architecture and Implementation of Vulcan,” Proc. Int'l Parallel Processing Symp., pp. 268274, Apr. 1994.
[43] H. Sullivan and T.R. Bashkow, "A Large Scale, Homogenous, Fully Distributed Parallel Machine," Proc. Fourth Ann. Int'l Symp. Computer Architecture, pp. 105117, May 1977.