This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Subcube Fault Tolerance in Hypercube Multiprocessors
September 1995 (vol. 44 no. 9)
pp. 1108-1120

Abstract—In this paper, we study the problem of constructing subcubes in faulty hypercubes. First a divide-and-conquer technique is used to form the set of disjoint subcubes in the faulty hypercube. The concept of irregular subcubes is then introduced to take advantage of advanced switching techniques, such as wormhole routing, to increase the sizes of the available subcubes. We present a subcube partitioning technique to form an irregular subcube of maximum size. The n-cube containing two faults is studied first because, in the worst case, two faults are sufficient to destroy all the possible regular (n− 1)-cubes. It is shown that the subcube partitioning technique is able to tolerate $\lceil {n \over 2}\rceil$ faults while maintaining a fault-free (n− 1)-cube in a faulty n-cube. In general, we show that a fault-free (nm− 1)-cube is guaranteed when there are $( \lceil {n -m \over 2}\rceil + 1) \times 2^m + 2^{m-1} -1$ or fewer faults. We also develop a two-phase subcube allocation strategy in order to show the average case performance of our subcube construction technique. Extensive simulation is conducted to show the effectiveness of the two-phase subcube allocation strategy.

[1] L.N. Bhuyan and D.P. Agrawal,“Generalized hypercube and hyperbus structures for a computer network,” IEEE Trans. Computers, pp. 323-333, Apr. 1984.
[2] nCUBE Coporation, nCUBE 2 Processor Manual, Dec. 1990.
[3] Intel, Intel iPSC/2, Intel Scientific Computers, 1988.
[4] M. S. Chen and K. G. Shin,“Processor allocation in an$N$-cube multiprocessor using gray codes,”IEEE Trans. Comput., vol. C-37, pp. 1396–1407, Dec. 1987.
[5] S. Dutt and J.P. Hayes, "Subcube Allocation in Hypercube Computers," IEEE Trans. Computers, vol. 40, no. 3, pp. 341-352, Mar. 1991.
[6] J. Kim, C.R. Das, and W. Lin, “A Top-Down Processor Allocation Scheme for Hypercube Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 20-30, Jan. 1991.
[7] P.-J. Chuang and N.-F. Tzeng,"A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers," IEEE Trans. Computers, pp. 467-479, Apr. 1992.
[8] Y. Chang and L.N. Bhuyan,“Fault tolerant subcube allocation in hypercubes,” Proc. Int’l Conf. Parallel Processing, pp. I-132-136, Aug. 1993.
[9] J. Hastad,T. Leighton,, and M. Newman,“Fast computation using faulty hypercubes,” Proc. 21st ACM Symp. Theory of Computing, 1989.
[10] M. Livingston,Q. Stout,N. Graham,, and F. Harary,“Subcube fault tolerance in hypercube,” Technical report CRL-TR-12-87, Univ. of Michigan, Computing Research Lab., Sept. 1987.
[11] B. Becker and H. Simon,“How robust is the n-cube?” Information and Computation, pp. 162-178, 1988.
[12] 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.
[13] 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.
[14] O.H. Kang,S.Y. Yoon,H.S. Yoon,, and J.W. Cho,“Heuristic subcube allocation in hypercube systems,” IEICE Trans. Information and Systems, pp. 517-526, July 1992.
[15] Q. Yang and H. Wang, "A New Graph Approach to Minimizing Processor Fragmentation in Hypercube Multiprocessors," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 1,165-1,171, Oct. 1993.
[16] E.A. Ramos, “Construction of 1-d Lower Envelopes and Applications,” Proc. 13th Ann. Symp. Computational Geometry, pp. 57-66, 1997.
[17] S.H. Bokhari,“Communication overheads on the Intel iPSC-2 hypercube,” Intel ICASE Interim Report 10, May 1990.
[18] M. Peercy and P. Banerjee, "Distributed Algorithms for Shortest-Path, Deadlock-Free Routing and Broadcasting in Arbitrarily Faulty Hypercubes," Proc. 20th Int'l Symp. Fault Tolerant Computing, pp. 218-225, June 1990.
[19] E. Chow, H.S. Madan, J.C. Peterson, D. Grunwald, and D. Reed, "Hyperswitch Network for the Hypercube Computer," Proc. 15th Ann. Symp. Computer Architecture, 1988.
[20] S. Abraham and K. Padmanabhan, "Performance of the Direct Binary n-Cube Network for Multiprocessors," IEEE Trans. Computers, vol. 38, no. 7, pp. 1000-1011, July 1989.
[21] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[22] D. Jokanovic,N. Shiratori,, and S. Noguchi,“Fault tolerant processor allocation in hypercube multiprocessors,” IEICE Trans. Information and Systems, vol. E74, no. 10, pp. 3,492-3,505, Oct. 1991.

Index Terms:
Hypercube, subcube partitioning, fault tolerance, wormhole routing.
Citation:
Laxmi N. Bhuyan, Yeimkuan Chang, "Subcube Fault Tolerance in Hypercube Multiprocessors," IEEE Transactions on Computers, vol. 44, no. 9, pp. 1108-1120, Sept. 1995, doi:10.1109/12.464389
Usage of this product signifies your acceptance of the Terms of Use.