Abstract
The Flexible Hypercube is a generalization of binary hypercube networks in that the number of nodes can be arbitrary in contrast to a strict power of 2. Restated, the Flexible Hypercube retains the connectivity and diameter properties of the corresponding hypercube. Although the embedding of complete binary trees in faulty hypercubes has received considerable attention, to our knowledge, no paper has demonstrated how to embed a complete binary tree in a faulty Flexible Hypercube. Therefore, this investigation presents a novel algorithm to facilitate the embedding job when the Flexible Hypercube contains faulty nodes. Of particular concern are the network structures of the Flexible Hypercube that balance the load before as well as after faults start to degrade the performance of the Flexible Hypercube. Furthermore, to obtain the replaceable node of the faulty node, 2-expansion is permitted such that up to (n − 2) faults can be tolerated with congestion 1, dilation 4 and load 1. That is, (n − 1) is the dimension of a Flexible Hypercube. Results presented herein demonstrate that embedding methods are optimized.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Bertsekas, D. P., and Tsitsiklis, J. N. (1989). Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, New Jersey.
Bhatt, S. N., Chung, F., Leighton, F. T., and Rosenberg, A. (1986). Optimal simulations of tree machines. Proc. 27th Ann. Symp. Foundations Comput. Sci., pp. 274–282.
Bhuyan, L., and Agrawal, D. P. (1984). Generalized hypercubes and hyperbus structure for a computer network. IEEE Trans. Computers 33, 323–333.
Hameenanttila, T., Guan, X.-L., Carothers, Jo Dale, and Chen, Jian-Xin (1996). The flexible hypercube: A new fault-tolerant architecture for parallel computing. J. Parallel and Distrib. Comput. 37, 213–220.
Hastad, J., Leighton, T., and Newman, M. (1987). Reconfiguring a hypercube in the presence of faults. ACM Theory of Computing, pp. 274–284.
Katseff, H. P. (1988). Incomplete hypercubes. IEEE Trans. on Computers 37(5), 604–608.
Keh, H.-C., and Lin, J.-C. (1997). Embedding a complete binary tree into a faulty supercube. IEEE Third Int'l. Conf. Algorithms and Architectures for Parallel Processing.
Keh, H.-C., and Lin, J.-C. (Undated). On fault-tolerant embedding of hamiltonian cycles, linear arrays and rings in a flexible hypercube. Parallel Computing (to appear).
Provost, F. J., and Melhem, R. (1992). A distributed algorithm for embedding trees in hypercubes with modifications for run-time fault tolerance. J. Parallel Distrib. Comput. 14, 85–89.
Rennels, D. A. (1986). On implemanting fault-tolerance in binary hypercubes. Proc. 16th Inter. Symp. on Fault-Tolerant Computing, pp. 344–349.
Sen, A., Sengupta, A., and Bandyopadhyay, S. (1990). Generalized supercube: An incrementally expandable interconnection network. Proc. Third Symp. Frontiers of Massively Parallel Computation-Frontiers '90, pp. 384–387.
Tien, S. B., Raghavendra, C. S., and Sridhar, M. A. (1990). Generalized Hypercubes and Hyperbus structure for a computer network. Hawaii Int'l. Conf. on System Science, pp. 91–100.
Tzeng, N.-F., and Chen, H.-L. (1992). An effective approach to the enhancement of incomplete hypercube computers. J. Parallel and Distrib. Comput. 14, 163–174.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Keh, HC., Lin, JC. Simulation of Complete Binary Tree Structures in a Faulty Flexible Hypercube. Journal of Scientific Computing 14, 245–258 (1999). https://doi.org/10.1023/A:1023217518658
Issue Date:
DOI: https://doi.org/10.1023/A:1023217518658