This Article 
 Bibliographic References 
 Add to: 
Fault-Tolerant Communication Algorithms in Toroidal Networks
October 1999 (vol. 10 no. 10)
pp. 976-983

Abstract—Fault-tolerant communication algorithms for $k$-ary $n$-cubes are introduced. These include: One-to-all broadcasting, all-to-all broadcasting, one-to-all personalized communication, and all-to-all personalized communication. Each of these algorithms can tolerate up to $(2n-2)$ node failures provided that $k > (2n-2)$ and $k > 3$. Extensions of these algorithms with up to $2n-1$ node failures are also described. The communication complexities of the proposed algorithms are derived when wormhole or store and forward packet routing is used.

[1] B. Al Mohammad and B. Bose, “Fault-Tolerant Communication Algorithms in Toroidal Networks” Proc. 28th Ann. Int'l Symp. Fault-Tolerant Computing, pp. 186–194, 1998.
[2] R. Alverson, D. Callahan, D. Cummings, B. Koblenz, A. Porterfield, and B. Smith, “The Tera Computer System,” technical report, Tera Computer Company, 1991.
[3] Cray T3D System Architecture Overview Manual, Cray Research, Inc., 1993.
[4] D. Culler,R. Karp,D. Patterson,A. Sahay,K.E. Schauser,E. Santos,R. Subramonian,, and T. von Eicken,“LogP: Towards a realistic model of parallel computation,” Fourth Symp. Principles and Practices Parallel Programming, SIGPLAN’93, ACM, May 1993.
[5] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[6] K. Day and A.E. Al-Ayyoub, “Fault Diameter ofk-Aryn-Cube Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 9, pp. 903-907, Sept. 1997.
[7] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Los Alamitos, Calif.: IEEE CS Press, 1997.
[8] P. Fraigniaud, "Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers," IEEE Trans. Computers, vol. 41, no. 11, pp. 1,410-1,419, Nov. 1992.
[9] K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, 1993.
[10] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
[11] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, 1994.
[12] T.C. Lee and J.P. Hayes,“A fault-tolerant communication scheme for hypercube computers,” IEEE Trans. Computers, vol. 41, no. 10, pp. 1,242-1,256, Oct. 1992.
[13] W. Oed, “Massively Parallel Processor System CRAY T3D,” technical report, Cray Research, Nov. 1993.
[14] S. Park and B. Bose, “All-to-All Broadcasting in Faulty Hypercubes,” IEEE Trans. Computers, vol. 46, no. 7,pp. 749–755, July 1997.
[15] C.S. Raghavendra,P.-J. Yang,, and S.-B. Tien,“Free dimensions—an effective approach to achieving fault tolerance in hypercubes,” 22nd Ann. Int’l Symp. Fault-Tolerant Computing, pp. 170-177, 1992.
[16] S. Scott and G. Thorson, “The Cray T3E Network: Adaptive Routing in High Performance 3D Torus,” Proc. HOT Interconnects IV, Stanford Univ., Aug. 1991.
[17] J. Wu and E.B. Fernandez, "Broadcasting in Faulty Hypercubes," Proc. 11th Symp. Reliable Distributed Systems, pp. 122-129, Oct. 1992.

Index Terms:
Interconnection networks, torus, $k$-ary $n$-cubes, fault-free communication algorithms, fault-tolerant communication algorithms.
B.f.a. AlMohammad, Bella Bose, "Fault-Tolerant Communication Algorithms in Toroidal Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 10, pp. 976-983, Oct. 1999, doi:10.1109/71.808130
Usage of this product signifies your acceptance of the Terms of Use.