This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Communication in Multicomputers with Nonconvex Faults
May 1997 (vol. 46 no. 5)
pp. 616-622

Abstract—A technique to enhance multicomputer routers for fault-tolerant routing with modest increase in routing complexity and resource requirements is described. This method handles solid faults in meshes, which includes all convex faults and many practical nonconvex faults, for example, faults in the shape of L or T. As examples of the proposed method, adaptive and nonadaptive fault-tolerant routing algorithms using four virtual channels per physical channel are described.

[1] A. Agarwal et al, "The MIT Alewife Machine: A Large-Scale Distributed-Memory Multiprocessor," Proc. Workshop Scalable Shared Memory Multiprocessors. Kluwer Academic Publishers, 1991.
[2] K. Bolding and L. Snyder,“Overview of fault handling for the chaos router,” Proc. 1991 IEEE Int’l Workshop Defect and Fault Tolerance in VLSI Systems, pp. 124-127, 1991.
[3] R. Boppana and S. Chalasani, "Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks," IEEE Trans. Computers, vol. 44, no. 7, pp. 848-864, July 1995.
[4] Y.M. Boura and C.R. Das, "Fault-Tolerant Routing in Mesh Networks," Proc. 1995 Int'l Conf. Parallel Processing, pp. I.106-I.109, Aug. 1995.
[5] S. Chalasani and R.V. Boppana, “Adaptive Fault-Tolerant Wormhole Routing Algorithms with Low Virtual Channel Requirements,” Proc. Int'l Symp. Parallel Architectures, Algorithms and Networks, pp. 214-221, Dec. 1994.
[6] S. Chalasani and R.V. Boppana, "Communication in Multicomputers with Nonconvex Faults," Proc. EURO-PAR '95, pp. 671-684, Aug. 1995.
[7] S. Chalasani and R.V. Boppana, "Communication in Multicomputers with Nonconvex Faults," Technical Report CS-96-12, Computer Science Division, Univ. of Texas at San Antonio, Oct. 1996.
[8] 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.
[9] Cray Research, Inc., Cray T3D System Architecture Overview, Sept. 1993.
[10] 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.
[11] 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.
[12] 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.
[13] P.T. Gaughan and S. Yalamanchili, "A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 6, pp. 482-487, May 1995.
[14] 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.
[15] Intel Corportation, Paragon XP/S Product Overview, 1991.
[16] M.D. Noakes, D.A. Wallach, and W.J. Dally, "The J-Machine Multicomputer: An Architectural Evaluation," Proc. 20th Ann. Int'l Symp. Computer Architecture, pp. 224-235, May 1993.
[17] C. Seitz,“Concurrent architectures,” VLSI and Parallel Computation, R. Suaya and G. Birtwislte, eds., ch. 1, pp. 1-84,San Mateo, Calif.: Morgan-Kaufman Publishers, Inc., 1990.
[18] 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. I.101-I.105, Aug. 1995.

Index Terms:
Solid faults, deadlocks, mesh networks, multicomputers, routing algorithms, wormhole routing.
Citation:
Suresh Chalasani, Rajendra V. Boppana, "Communication in Multicomputers with Nonconvex Faults," IEEE Transactions on Computers, vol. 46, no. 5, pp. 616-622, May 1997, doi:10.1109/12.589238
Usage of this product signifies your acceptance of the Terms of Use.