This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications
April 1997 (vol. 46 no. 4)
pp. 484-490

Abstract—In this paper, we present an interconnection structure, called the balanced hypercube, which is a variation of the standard hypercube with desirable properties of strong connectivity, regularity, and symmetry. The proposed structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that shares the same set of neighboring nodes. Therefore, tasks that run on a faulty processor can be reactivated in the backup processor to provide efficient system reconfiguration. Other properties of balanced hypercubes are examined. It is also shown that odd-dimensional balanced hypercubes have smaller diameters than that of standard hypercubes. As an application of balanced hypercubes, we show a fault-tolerant embedding of rings in balanced hypercubes.

[1] L.N. Bhuyan and D.P. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. 32, no. 4, pp. 323-333, Apr. 1984.
[2] S. Dutt and J.P. Hayes, “Designing Fault-Tolerant Systems Using Auto-morphisms,” J. Parallel and Distributed Computing, vol. 12, no. 3, pp. 249–268, 1991.
[3] A. El-Amawy and S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 31-42, 1991.
[4] J.P. Hayes and T. Mudge, "Hypercube Supercomputers," Proc. IEEE, vol. 77, no. 12, pp. 1,829-1,841, Dec. 1989.
[5] K. Huang and J. Wu, "Balanced Hypercubes," Technical Report CSE-92-6, Dept. of Computer Science and Eng., Florida Atlantic Univ., Feb. 1992.
[6] K. Huang and J. Wu, "Area Efficient Layout of Balanced Hypercubes," Int'l J. High Speed Electronics and Systems, vol. 6, no. 4, pp. 631-646, 1995.
[7] T.C. Lee, "Quick Recovery of Embedding Structures in Hypercube Computers," Proc. Fifth Distributed Memory Computing Conf., pp. 1,426-1,435, 1990.
[8] T.C. Lee and J.P. Hayes, "One-Step-Degradable Fault-Tolerant Hypercubes," Proc. Fourth Conf. Hypercubes, pp. 94-97, Mar. 1989.
[9] J. Liu, T.J. Sager, and B.M. McMillin, "An Improved Characterization of 1-step Recoverable Embeddings: Rings in Hypercubes," Technical Report CS-92-07, Univ. of Missouri at Rolla, Nov. 1992.
[10] N. Sherwani, A. Boals, and H. Ali, "Load Balancing Graphs," Congressus Numerantium, vol. 73, pp. 205-214, 1990.
[11] N.-F. Tzeng and S. Wei, “Enhanced Hypercubes,” IEEE Trans. Computers, vol. 40, no. 3, pp. 284-294, Mar. 1991.
[12] J. Wu and K. Huang, "Fault-Tolerant Ring Embedding in Balanced Hypercubes," Technical Report CSE-93-5, Dept. of Computer Science and Eng., Florida Atlantic Univ., Jan. 1993.
[13] P-.J. Yang, S-.B. Tien, and C.S. Raghavendra, "Reconfiguration of Rings and Meshes in Faulty Hypercubes," J. Parallel and Distributed Computing, vol. 22, pp. 96-106, 1994.
[14] R.M. Yanney and J.P. Hayes, "Distributed Recovery in Fault-Tolerant Multiprocessor Networks," IEEE Trans. Computers, vol. 35, pp. 871-879, 1986.

Index Terms:
Embedding, fault tolerance, hypercubes, interconnection networks, reconfiguration.
Citation:
Jie Wu, Ke Huang, "The Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications," IEEE Transactions on Computers, vol. 46, no. 4, pp. 484-490, April 1997, doi:10.1109/12.588063
Usage of this product signifies your acceptance of the Terms of Use.