
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Eric Fleury, Pierre Fraigniaud, "A General Theory for Deadlock Avoidance in WormholeRouted Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 7, pp. 626638, July, 1998.  
BibTex  x  
@article{ 10.1109/71.707539, author = {Eric Fleury and Pierre Fraigniaud}, title = {A General Theory for Deadlock Avoidance in WormholeRouted Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {7}, issn = {10459219}, year = {1998}, pages = {626638}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.707539}, 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 General Theory for Deadlock Avoidance in WormholeRouted Networks IS  7 SN  10459219 SP626 EP638 EPD  626638 A1  Eric Fleury, A1  Pierre Fraigniaud, PY  1998 KW  Routing KW  wormhole KW  deadlock KW  multicast. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Most machines of the last generation of distributed memory parallel computers possess specific
[1] V.S. Adve and M.K. Vernon, “Performance Analysis of Mesh Interconnection Networks with Deterministic Routing,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 3, pp. 225246, Mar. 1994.
[2] K.V. Anjan and T.M. Pinkston, “An Efficient, Fully Adaptive Deadlock Recovery Scheme: Disha,” Proc. 22nd Ann. Int'l Symp. Computer Architecture, pp. 201210, June 1995.
[3] K.V. Anjan, T.M. Pinkston, and J. Duato, Generalized Theory for DeadlockFree Adaptive Routing and Its Application to Disha Concurrent Proc. 10th Int'l Parallel Processing Symp., Apr. 1996.
[4] K. Aoyama and A.A. Chien, "The Cost of Adaptativity and Virtual Lanes," J. VLSI Design, 1993.
[5] A. Arruabarrena, R. Beivide, C. Izu, and J. Miguel, "A Performance Evaluation of Adaptive Routing in Bidimensional CutThrough Networks," Parallel Processing Letters, vol. 3, pp. 469484, 1993.
[6] B. Awerbuch, A. BarNoy, N. Linial, and D. Peleg, "Improved Routing Strategies with Succinct Tables," J. Algorithms, vol. 11, pp. 307341, 1990.
[7] A. BenDor, S. Halevi, and A. Schuster, "Potential Function Analysis of Greedy HotPotato Routing," Proc. 13th ACM Symp. Principles Distributed Computing, pp. 225234, 1993.
[8] 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.
[9] J.C. Bermond and C. Peyrat, "de Bruijn and Kautz Networks: A Competitor for the Hypercube?," Hypercube and Distributed Computers, F. Andre and J. Verjus, eds., pp. 279294. NorthHolland, 1989.
[10] J.C. Bermond and M. Syska, "Routage Wormhole et Canaux Virtuels," Algorithmique Parallèle, M.N.M. Cosnard and Y. Robert, eds., pp. 149158.Masson, 1992.
[11] N. Biggs, Algebraic Graph Theory.London: Cambridge Univ. Press, 1974.
[12] R. Boppana and S. Chalasani, "New Wormhole Routing Algorithms for Multicomputers," Proc. Seventh Int'l Parallel Processing Symp., pp. 419423,Newport Beach, Calif., Apr. 1993.
[13] C.M. Chiang and L. Ni, "DeadlockFree MultiHead Wormhole Routing," Proc. First High Performance Computing Asia Conf., 1995.
[14] A. Chien, "A Cost and Speed Model for kary nCube Wormhole routers," Proc. Hot Interconnects '93,Palo Alto, Calif., Aug. 1993.
[15] F. Chung, E. Coffman, M. Reiman, and B. Simon, "The Forwarding Indices of Communication Networks," IEEE Trans. Information Theory, vol. 33, pp. 224232, 1987.
[16] R. Cypher and L. Gravano, "Adaptive, DeadlockFree Packet Routing in Torus Networks with Minimal Storage," Proc. 1992 Int'l Conf. Parallel Processing, vol. III, pp. 204211, Aug. 1992.
[17] R. Cypher and L. Gravano, "Requirements for DeadlockFree, Adaptive Packet Routing," Proc. 11th ACM Symp. Principles Distributed Computing, 1992.
[18] W.J. Dally, "VirtualChannel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194205, Mar. 1992.
[19] 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.
[20] W. Dally and C. Seitz, "The Torus Routing Chip," Distributed Computing, vol. 1, pp. 187196, 1986.
[21] 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.
[22] M. Di Ianni, "Wormhole Deadlock Prediction," Proc. EuroPar '97, LNCS 1300, 1997.
[23] J. Duato, “On the Design of DeadlockFree Adaptive Routing Algorithms for Multicomputers: Design Methodologies,” Proc. Parallel Architectures and Languages Europe 91, June 1991.
[24] J. Duato, "On the Design of Deadlock Free Adaptative Routing Algorithms for Multicomputers: Theoretical Aspects," Lecture Notes in Computer Science 487, Distributed Memory Computing, A Bode, ed., pp. 234243. Springer Verlag, 1991.
[25] J. Duato, " Channel Classes: A New Concept for Deadlock Avoidance in Wormhole Networks," Parallel Processing Letters, vol. 2, pp. 347354, 1992.
[26] 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.
[27] J. Duato, "On the Design of DeadlockFree Adaptive Multicast Routing," Parallel Processing Letters, vol. 3, pp. 321334, 1993.
[28] J. Duato, "A Theory to Increase the Effective Redundancy in Wormhole Networks," Parallel Processing Letters, vols. 1and 2, pp. 125138, 1994.
[29] J. Duato, “A Necessary and Sufficient Condition for DeadlockFree Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 10, pp. 1,055–1,067, Oct. 1995.
[30] J. Duato,"A Theory of DeadlockFree Adaptive Multicast Routing in Wormhole Networks," Trans. Parallel and Distributed Systems, vol. 6, no. 9, Sept. 1995, pp. 976987.
[31] U. Feige and P. Raghavan, "Exact Analysis of Hot Potato Routing. 33rd Ann. Symp. Foundations of Computer Science, pp. 553562, Oct. 1992.
[32] S. Felperin, P. Raghavan, and E. Upfal, "A Theory of Wormhole Routing in Parallel Computers," Proc. 33rd Ann. IEEE Conf. Foundations of Computer Science, pp. 563572, 1992.
[33] E. Fleury and P. Fraigniaud, "Deadlocks in Adaptive Wormhole Routing," Research Report 9409, Laboratoire de l'Informatique du Parallélisme, ENSLyon, France, 1994.
[34] P. Fraigniaud, "Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers," IEEE Trans. Computers, vol. 41, no. 11, pp. 1,4101,419, Nov. 1992.
[35] P. Fraigniaud and C. Gavoille, "Memory Requirement for Universal Routing Schemes," Proc. 14th Ann. ACM Symp. Principles of Distributed Computing (PODC), pp. 223230, 1995.
[36] P. Fraigniaud and E. Lazard, "Methods and Problems of Communication in Usual Networks," Discrete Applied Math., vol. 53, pp. 79133, 1994.
[37] D. Gelernter, "A DAGBased Algorithm for Prevention of StoreAndForward Deadlock in Packet Networks," IEEE Trans. Computers, vol. 30, pp. 709715, 1981.
[38] C. Germain, "Etude des Mécanismes de Communication Pour une Machine Massivement Parallèle: MEGA," PhD thesis, UniversitéParis Sud, Orsay, France, 1989.
[39] C.J. Glass and L.M. Ni, “Adaptive Routing in MeshConnected Networks,” Proc. 1992 Int'l Conf. on Distributed Computing Systems, pp. 1219, May 1992.
[40] C. Glass and L. Ni, "Maximally Fully Adaptive Routing in 2D Meshes," Proc. 1992 Int'l Conf. Parallel Processing, vol. I, pp. 101104, Aug. 1992.
[41] 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.
[42] C.J. Glass and L.M. Ni, "FaultTolerant Wormhole Routing in Meshes," Proc. 23rd Int'l Symp. FaultTolerant Computing, pp. 240249, 1993.
[43] C.J. Glass and L.M. Ni, “The Turn Model for Adaptive Routing,” J. ACM, vol. 41, no. 5, pp. 874902, Sept. 1994.
[44] D. Bäumer et al., "Framework Development for Large Systems," Comm. ACM, vol. 40, no. 10, Oct. 1997, pp. 5259.
[45] K.D. Gunther, "Prevention of Deadlocks in PacketSwitched Data Transport Systems," IEEE Trans. Commun., vol. 29, pp. 512524, Apr. 1981.
[46] B. Hajek, "Bound on Evacuation Time for Deflection Routing," Distributed Computing, vol. 5, pp. 16, 1991.
[47] S. Hedetniemi, S. Hedetniemi, and A. Liestman, "A Survey of Gossiping and Broadcasting in Communication Networks," Networks, vol. 18, pp. 319349, 1986.
[48] M.C. Heydemann, J.C. Meyer, and D. Sotteau, "On Forwarding Indices of Networks," Discrete Applied Mathematics, vol. 23, pp. 103123, 1989.
[49] D.N. Jayasimha, D. Manivannan, J.A. May, L. Schwiebert, and S.L. Hary, “A Foundation for Designing DeadlockFree Routing Algorithms in Wormhole Networks,” Proc. Symp. Parallel and Distributed Processing, pp. 190197, Oct. 1996.
[50] P. Kermani and L. Kleinrock, "Virtual CutThrough: A New Computer Communication Switching Technique," Computers Networks, vol. 3, pp. 267286, 1979.
[51] F.T. Leighton,"Average Case Analysis of Greedy Routing Algorithms on Arrays," Proc. Second Ann. ACM Symp. Parallel Algorithms and Architectures, SPAA '90, Crete, July26, 1990.
[52] X. Lin, P.K. McKinley, L.M. Ni, “The Message Flow Model for Routing in WormholeRouted Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 7, pp. 755–760, July 1995.
[53] X. Lin and L. Ni, "DeadlockFree Multicast Wormhole Routing in Multicomputer Networks," Proc. Int'l Symp. Computer Architecture, June 1991.
[54] 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.
[55] The T9000 ProductsOverview Manual, P.T.M. May and P. Welch, eds. SGSThomsonInmos, 1991.
[56] P.M. Merlin and P.J. Schweitzer, "Deadlock Avoidance in StoreandForward NetworksI: StoreandForward Deadlock," IEEE Trans. Commun., vol. 28, no. 3, pp. 345354, Mar. 1980.
[57] J. Misic and Z. Jovanovic, "Routing Function and Deadlock Avoidance in a Star Graph Interconnection Network," J. Parallel and Distributed Computing, vol. 22, pp. 216228, 1994.
[58] 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.
[59] P.S. Pacheco, Parallel Programming with MPI. Morgan Kaufmann, 1997.
[60] D.K. Panda, S. Singal, and P. Prabhakaran, “Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme,” Proc. Parallel Computer Routing and Comm. Workshop, pp. 131–145, 1994.
[61] H. Park and D.P. Agrawal, “Generic Methodologies for DeadlockFree Routing,” Proc. Int'l Parallel Processing Symp., pp. 638643, Apr. 1996.
[62] D. Peleg and E. Upfal, "A TradeOff Between Space and Efficiency for Routing Tables," J. ACM, vol. 36, pp. 510530, 1989.
[63] J. Peters and M. Syska, "CircuitSwitched Broadcasting in Torus Networks," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 3, pp. 246255, 1996.
[64] 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.
[65] A. Reddy, "Fault Tolerance of Adaptive Routing Algorithms in Multicomputers," technical report, IBM Almaden Research Center, San Jose, Calif., 1992.
[66] J.D. Rumeur, "Communcation dans les Réseaux de Processeurs," Collection Etudes et Recherches en Informatique.Masson, 1994.
[67] 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.
[68] L. Schwiebert, "DeadlockFree Oblivious Wormhole Routing with Cyclic Dependencies," Proc. Ninth Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '97), pp. 149158, 1997.
[69] L. Schwiebert and D.N. Jayasimha, “A Universal Proof Technique for DeadlockFree Routing in Interconnection Networks,” Proc. Symp. Parallel Algorithms and Architectures, pp. 175–184, July 1995.
[70] L. Schwiebert and D.N. Jayasimha, "A Necessary and Sufficient Condition for DeadlockFree Wormhole Routing," J. Parallel and Distributed Computing, vol. 32, no. 1, pp. 103117, Jan. 1996.
[71] A. Tanenbaum, Computer Networks pp. 1521. Prentice Hall, 1981.
[72] C. Trefftz and P. McKinley, "Performance Evaluation of Wormhole Routing in Octagonal Mesh Direct Network," Proc. Int'l Conf. Parallel and Distributed Systems, pp. 2532, 1992.
[73] E. Upfal, "On the Theory of Interconnection Networks for Parallel Computer," Proc. Int'l Colloquium on Automata, Languages, and Programming (ICALP '94), 1994.
[74] L. Valiant, "A Scheme for Fast Parallel Communication," SIAM J. Computing, vol. 11, pp. 350361, 1982.
[75] V. Varavithya and P. Mohapatra, "TreeBased Multicasting on Wormhole Routed Multistage Interconnection Networks," Proc. 1997 Int'l Conf. Parallel Processingi, 1997.
[76] C. Yang and Y. Tsai, "FaultTolerant and DeadlockFree Wormhole Routing in the Hybercube Network," Proc. Int'l Conf. Parallel and Distributed Systems, pp. 916, 1992.