This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Determination of Maximum Incomplete Subcubes in Hypercubes with Faults
November 1996 (vol. 45 no. 11)
pp. 1303-1308

Abstract—After faults arise in a hypercube, it is often desirable to reconfigure the faulty hypercube in such a way as to retain as many fault-free nodes as possible, because system performance tends to be in proportion to the computational power, and a reconfigured hypercube with more nodes is likely to retain performance better. This inspires us to identify maximum incomplete subcubes in a faulty hypercube, as the subcube so reconfigured is often much larger than that reconfigured according to earlier schemes. Here we propose an efficient algorithm for determining maximum incomplete subcubes in faulty hypercubes. The basic idea is to construct a maximum incomplete subcube from a number of healthy complete subcubes of distinct sizes. To this end, an efficient procedure for finding all maximum fault-free complete subcubes in a faulty hypercube is introduced, and then an efficient algorithm for determining maximum incomplete subcubes is presented.

[1] S.-C. Chau and A.L. Liestman, "A Proposal for a Fault-Tolerant Binary Hypercube Architecture," Proc. 19th Int'l Symp. Fault-Tolerant Computing, pp. 323-330, June 1989.
[2] T.C. Lee and J.P. Hayes, "Design of Gracefully Degradable Hypercube-Connected Systems," J. Parallel and Distributed Computing, vol. 14, pp. 390-401, 1992.
[3] J. Bruck, R. Cypher, and C.-T. Ho, "Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes," Proc. 23rd Int'l Symp. Fault-Tolerant Computing, pp. 260-267, June 1993.
[4] J. Bruck, R. Cypher, and C.-T. Ho, "Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares," IEEE Trans. Computers, vol. 42, no. 9, pp. 1,089-1,104, Sept. 1993.
[5] B. Aiello and T. Leighton, "Coding Theory, Hypercube Embeddings, and Fault Tolerance," Proc. Third Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 125-136, July 1991.
[6] J. Bruck, R. Cypher, and D. Soroker, "Tolerating Faults in Hypercubes Using Subcube Partitioning," IEEE Trans. Computers, vol. 41, no. 5, pp. 599-605, May 1992.
[7] B. Becker and H.-U. Simon, "How Robust Is the n-Cube?" Proc. IEEE 27th Symp. Foundations of Computer Science, pp. 283-291, Oct. 1986.
[8] F. Ozguner and C. Aykanat, "A Reconfiguration Algorithm for Fault Tolerance in a Hypercube Multiprocessor," Information Processing Letters, vol. 29, pp. 247-254, Nov. 988.
[9] M.A. Sridhar and C.S. Raghavendra, "On Finding Maximal Subcubes in Residual Hypercubes," Proc. Second IEEE Symp. Parallel and Distributed Processing, pp. 870-873, Dec. 1990.
[10] S. Latifi, "Distributed Subcube Identification Algorithms for Reliable Hypercubes," Information Processing Letters, vol. 38, pp. 315-321, June 1991.
[11] H.P. Katseff, "Incomplete Hypercubes," IEEE Trans. Computers, vol. 37, no. 5, pp. 604-608, May 1988.
[12] N.-F. Tzeng, "Empirical Evaluation of Incomplete Hypercube Systems," Proc. 22nd Int'l Conf. Parallel Processing, vol. I, pp. 96-99, Aug. 1993.
[13] N.-F. Tzeng and H.-L. Chen, "Structural and Tree Embedding Aspects of Incomplete Hypercubes," IEEE Trans. Computers, vol. 43, no. 12, pp. 1,434-1,439, Dec. 1994.
[14] M.-S. Chen and K.G. Shin, "Adaptive Fault-Tolerant Routing in Hypercube Multicomputers," IEEE Trans. Computers, vol. 39, no. 12, pp. 1,406-1,416, Dec. 1990.
[15] P. Ramanathan and K.G. Shin, "Reliable Broadcast in Hypercube Multicomputers," IEEE Trans. Computers, vol. 37, no. 12, pp. 1,654-1,657, Dec. 1988.
[16] N-F. Tzeng and G. Lin, "Identifying Maximal Incomplete Subcubes in Faulty Hypercubes," Proc. Seventh Int'l Conf. Parallel and Distributed Computing Systems, pp. 186-193, Oct. 1994.

Index Terms:
Fault patterns, hypercubes, incomplete subcubes, maximum subcubes, reconfiguration, time complexity.
Citation:
Nian-Feng Tzeng, Guanghua Lin, "Efficient Determination of Maximum Incomplete Subcubes in Hypercubes with Faults," IEEE Transactions on Computers, vol. 45, no. 11, pp. 1303-1308, Nov. 1996, doi:10.1109/12.544487
Usage of this product signifies your acceptance of the Terms of Use.