
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M.S. Chen, K.G. Shin, "DepthFirst Search Approach for FaultTolerant Routing in Hypercube Multicomputers," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 2, pp. 152159, April, 1990.  
BibTex  x  
@article{ 10.1109/71.80143, author = {M.S. Chen and K.G. Shin}, title = {DepthFirst Search Approach for FaultTolerant Routing in Hypercube Multicomputers}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {1}, number = {2}, issn = {10459219}, year = {1990}, pages = {152159}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.80143}, 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  DepthFirst Search Approach for FaultTolerant Routing in Hypercube Multicomputers IS  2 SN  10459219 SP152 EP159 EPD  152159 A1  M.S. Chen, A1  K.G. Shin, PY  1990 KW  Index Termsfaulttolerant routing; hypercube multicomputers; depthfirst search; performance; Hamming distance; obstructed node; destination node; component failures; fault tolerant computing; multiprocessing systems; multiprocessor interconnection networks; performance evaluation VL  1 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Using depthfirst search, the authors develop and analyze the performance of a routing scheme for hypercube multicomputers in the presence of an arbitrary number of faulty components. They derive an exact expression for the probability of routing messages byway of optimal paths (of length equal to the Hamming distance between the corresponding pair of nodes) from the source node to an obstructed node. The obstructed node is defined as the first node encountered by the message that finds no optimal path to the destination node. It is noted that the probability of routing messages over an optimal path between any two nodes is a special case of the present results and can be obtained by replacing the obstructed node with the destination node. Numerical examples are given to illustrate the results, and they show that, in the presence of component failures, depthfirst search routing can route a message to its destination by means of an optimal path with a very high probability.
[1] Y. Saad and M. H. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. C37, pp. 867872, July 1988.
[2] F. Ercal, J. Ramanujam, and P. Sadayappan, "Task allocation onto a hypercube by recursive mincut bipartitioning," inProc. 3rd Conf. Hypercube Concurrent Comput. Appl., Jan. 1988, pp. 210221.
[3] M.S. Chen and K. G. Shin, "Processor allocation in anNcube multiprocessorusing Gray codes,"IEEE Trans. Comput., vol. C36, no. 12, pp. 13961407, Dec. 1987.
[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. 12261244, Dec. 1989.
[5] T. N. Mudge and T. S. AbdelRahman, "Vision algorithms for hypercube machines,"J. Parallel Distributed Comput., vol. 4, pp. 7994, 1987.
[6] T. F. Chan and Y. Saad, "Multigrid algorithms on the hypercube multiprocessor,"IEEE Trans. Comput., vol. C35, no. 11, pp. 969977, Nov. 1986.
[7] C. Aykanat, F. Ozguner, F. Ercal, and P. Sadayappan, "Iterative algorithms for solution of large sparse systems of linear equations on hypercubes,"IEEE Trans. Comput., vol. C37, pp. 15541568, Dec. 1988.
[8] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 2233, Jan. 1985.
[9] NCUBE Corp., "NCUBE/ten: An overview," Beaverton, OR, Nov. 1985.
[10] Intel Corp.,Intel iPSC System Overview, Jan. 1986.
[11] S. L. Johnson and C. T. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. C38, pp.12491268, Sept. 1989.
[12] M.S. Chen and K. G. Shin, "On hypercube faulttolerant routing using global information," inProc. Fourth Conf. Hypercube Concurrent Comput. Appl., Mar. 68, 1989.
[13] C. K. Kim and D. A. Reed, "Adaptive packet routing in a hypercube," inProc. 3rd Conf. Hypercube Concurrent Comput. Appl., Jan. 1988.
[14] J. G. Kuhl and S. M. Reddy, "Distributed faulttolerance for large multiprocessor system," inProc. 1980 Comput. Architecture Conf., France, May 1980.
[15] T. C. Lee and J. P. Hayes, "Routing and broadcasting in faulty hypercube computers," inProc. 3rd Conf. Hypercube Concurrent Comput. and Appl., vol. I, Jan. 1988, pp. 346354.
[16] P. Ramanathan and K. G. Shin, "Reliable broadcast in hypercube multicomputers,"IEEE Trans. Comput., vol. C37, pp. 16541656, Dec. 1988.
[17] J. R. Armstrong and F. G. Gray, "Fault diagnosis in a Booleann cube array of multiprocessors,"IEEE Trans. Comput., vol. C30, pp. 587590, Aug. 1981.
[18] 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. 312317.
[19] J. M. Gordon and Q. F. Stout, "Hypercube message routine in the presence of faults," inProc. 3rd Conf. Hypercube Concurrent Comput. and Appl., Jan. 1988, pp. 318327.
[20] 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. 9099.
[21] T. Y. Feng, "A survey of interconnection networks,"IEEE Comput., pp. 1227, Dec. 1981.
[22] M.S. Chen, K. G. Shin, and D. D. Kandlur, "Addressing, routing, and broadcasting in hexagonal mesh multiprocessors,"IEEE Trans. Comput., vol. C39, pp. 1018, Jan. 1990.
[23] F. Harary,Graph Theory. Reading, MA: AddisonWesley, 1969.
[24] E. N. Gilbert, "Gray codes and paths on the ncube,"Bell Syst. Tech. J., vol. 37, pp. 263267, 1973.
[25] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: AddisonWesley, 1973.
[26] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: AddisonWesley, 1974.
[27] C. L. Liu,Introduction of Combinatorial Mathematics. New York: McGrawHill, 1968.