This Article 
 Bibliographic References 
 Add to: 
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
December 1990 (vol. 39 no. 12)
pp. 1406-1416

A connected hypercube with faulty links and/or nodes is called an injured hypercube. A distributed adaptive fault-tolerant routing scheme is proposed for an injured hypercube in which each node is required to know only the condition of its own links. Despite its simplicity, this scheme is shown to be capable of routing messages successfully in an injured n-dimensional hypercube as long as the number of faulty components is less than n. Moreover, it is proved that this scheme routes messages via shortest paths with a rather high probability, and the expected length of a resulting path is very close so that of a shortest path. Since the assumption that the number of faulty components is less than n in an n-dimensional hypercube might limit the usefulness of the above scheme, a routing scheme based on depth-first search which works in the presence of an arbitrary number of faulty components is introduced. Due to the insufficient information on faulty components, however, the paths chosen by this scheme may not always be the shortest. To guarantee all messages to be routed via shortest paths, the authors propose to equip every node with more information than that on its own links. The effects of this additional information on routing efficiency are analyzed, and the additional information to be kept at each node for the shortest path routing is determined. Several examples and remarks are given to illustrate the results.

[1] M.-S. Chen and K. G. Shin, "Processor allocation in anN-cube multiprocessorusing Gray codes,"IEEE Trans. Comput., vol. C-36, no. 12, pp. 1396-1407, Dec. 1987.
[2] L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., vol. C-33, no. 4, pp. 323-333, Apr. 1984.
[3] T. F. Chan and Y. Saad, "Multigrid algorithms on the hypercube multiprocessor,"IEEE Trans. Comput., vol. C-35, no. 11, pp. 969-977, Nov. 1986.
[4] M.-S. Chen and K. G. Shin, "On relaxed squashed embedding of graphs a into hypercube,"SIAM J. Comput., vol. 18, no. 6, pp. 1226-1244, Dec. 1989.
[5] B. Becker and H. U. Simon, "How robust is then-cube?," inProc. 27th Annu. Symp. Foundations Comput. Sci., Oct. 1986, pp. 283-291.
[6] Y. Saad and M. H. Schultz, "Data communication in hypercubes," Dep. Comput. Sci., Yale Univ. Res. Rep. 428/85., 1985.
[7] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[8] NCUBE Corp., "NCUBE/ten: An overview," Beaverton, OR, Nov. 1985.
[9] E. Chow, H. S. Madan, J. C. Peterson, D. Grunwald, and D. Reed, "Hyperswitch network for the hypercube computer," inProc. 15th Ann. Int. Symp. Comput. Architecture, 1988, pp. 90-99.
[10] D. K. Pradhan, "Fault-tolerant multiprocessor link and bus network architectures,"IEEE Trans. Comput., vol. C-34, no. 1, pp. 33-45, Jan. 1985.
[11] J. G. Kuhl and S. M. Reddy, "Distributed fault-tolerance for large multiprocessor system," inProc. 1980 Comput. Architecture Conf., France, May 1980.
[12] A.-H. Esfahanian and S. L. Hakimi, "Fault-tolerant routing in de Bruijn communications networks,"IEEE Trans. Comput., vol. C-34, pp. 777-788, Sept. 1985.
[13] A. Ghafoor, T. R. Bashkow, and I. Ghafoor, "Fault-tolerance and diagnosability of bisectional interconnection networks," inProc. 6th Int. Conf. Distributed Comput. Syst., 1986, pp. 62-69.
[14] D. K. Pradhan and S. M. Reddy, "A fault-tolerant communication architecture for distributed systems,"IEEE Trans. Comput., vol. C-31, no. 9, pp. 863-870, Sept. 1982.
[15] M. S. Chen and K. G. Shin, "Message routing in an injured hypercube," inProc. 3rd Conf. Hypercube Concurrent Comput. and Appl., vol. I, Jan. 1988, pp. 312-317.
[16] M.-S. Chen and K. G. Shin, "On hypercube fault-tolerant routing using global information," inProc. Fourth Conf. Hypercube Concurrent Comput. Appl., Mar. 1989, pp. 83-86.
[17] C. K. Kim and D. A. Reed, "Adaptive packet routing in a hypercube," inProc. 3rd Conf. Hypercube Concurrent Comput. Appl., Jan. 1988.
[18] S. L. Johnsson and C. T. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. C-38, no. 9, pp. 1249-1268, Sept. 1989.
[19] H. Katseff, "Incomplete hypercube,"IEEE Trans. Comput., vol. C-37, no. 5, pp. 604-608, May 1988.
[20] J. R. Armstrong and F. G. Gray, "Fault diagnosis in a Booleann-cube array of microprocessors,"IEEE Trans. Comput., vol. C-30, no. 8, pp, 587-590, Aug. 1981.
[21] M.-S. Chen and K. G. Shin, "Depth-first search approach for fault-tolerant routing in hypercube multicomputers,"IEEE Trans. Parallel Distributed Syst., vol. 1, no. 2, pp. 152-159, Apr. 1990.
[22] J. M. McQuillan and D. C. Walden, "The ARPA network design decisions,"Comput. Networks, vol. 1, no. 5, pp. 243-289, Aug. 1977.
[23] F. Harary,Graph Theory. Reading, MA: Addison-Wesley, 1969.
[24] E. N. Gilbert, "Gray codes and paths on the N-cube,"Bell Syst. Tech. J., vol. 37, pp. 263-267, 1973.
[25] Y. Saad and M. H. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. C-37, no. 7, pp. 867-872, July 1988.
[26] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[27] K. A. Ross and C. R. B. Wright,Discrete Mathematics. Englewood Cliffs, NJ: Prentice-Hall, 1985.
[28] C. L. Liu,Introduction to Combinatorial Mathematics. New York: McGraw Hill, 1968.
[29] K. G. Shin and M.-S. Chen, "Performance analysis of distributed routing strategies free of ping-pong-type looping,"IEEE Trans. Comput., vol. C-36, no. 2, pp. 129-137, Feb. 1987.
[30] K. G. Shin and M.-S. Chen, "Minimal order loop-free routing strategy,"IEEE Trans. Comput., vol. 39, no. 7, pp. 870-881, July 1990.

Index Terms:
adaptive fault tolerant routing; hypercube multicomputers; depth-first search; fault tolerant computing; multiprocessor interconnection networks.
M.-S. Chen, K.G. Shin, "Adaptive Fault-Tolerant Routing in Hypercube Multicomputers," IEEE Transactions on Computers, vol. 39, no. 12, pp. 1406-1416, Dec. 1990, doi:10.1109/12.61061
Usage of this product signifies your acceptance of the Terms of Use.