This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Structural and Tree Embedding Aspects of Incomplete Hypercubes
December 1994 (vol. 43 no. 12)
pp. 1434-1439

Since the hypercube is not incrementally scalable, a variant hypercube topology with more flexibility in the system size, called an incomplete hypercube, is examined. An incomplete hypercube may also result from a complete hypercube which operates in a degraded manner after some nodes fail. Elementary properties, including diameter, mean internode distance, and traffic density, of incomplete hypercubes with size 2/sup n/+2/sup k/, 0/spl les/k/spl les/n, are derived. Interestingly, traffic density over links in such an incomplete hypercube is found to be bounded by 2 (messages per link per unit time), despite its structural nonhomogeneity. Thus, cube links can easily be constructed so as to avoid any single point of congestion, guaranteeing good performance. The minimum incomplete hypercubes able to embed binary trees with node adjacencies preserved are determined.

[1] D. A. Reed and R. M. Fujimoto,Multicomputer Networks, Message-Based Parallel Processing. Cambridge, MA: MIT Press, 1987.
[2] W.-J. Hsu, "Fibonacci cubes--A new interconnection topology,"IEEE Trans. Parallel Distrib. Syst., Vol. 4, pp. 3-12, Jan. 1993.
[3] W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[4] M. Y. Chan and S.-J. Lee, "Fault-tolerant embedding of complete binary trees in hypercubes,"IEEE Trans. Parallel Distrib. Syst., vol. 4. pp. 277-288, Mar. 1993.
[5] H. P. Katseff, "Incomplete hypercubes,"IEEE Trans. Comput., vol. 37, pp. 604-608, May 1988.
[6] N.-F. Tzeng, "Structural properties of incomplete hypercube computers," inProc. 10th IEEE Int. Conf. Distrib. Computing Syst., May 1990, pp. 262-269.
[7] H.-L. Chen and N.-F. Tzeng, "Distributed identification of all maximal incomplete subcubes in a faulty hypercube," inProc. 8th Int. Parallel Processing Symp., Apr. 1994, pp. 723-728.
[8] S. R. Deshpande and R. M. Jenevein, "Scalability of binary tree on a hypercube," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 661-668.
[9] A. Y. Wu, "Embedding of tree: networks into hypercubes,"J. Parallel Distrib. Computing, vol. 2, pp, 238-249, 1985.
[10] N.-F. Tzeng, P.-J. Chuang, and H.-L. Chen, "Embeddings in incomplete hypercubes," inProc. 1990 Int. Conf. Parallel Processing, vol. III, Aug. 1990, pp. 335-339.

Index Terms:
hypercube networks; message passing; tree embedding; structural embedding; incomplete hypercubes; cube links; binary trees; node adjacencies.
Citation:
Nian-Feng Tzeng, Hsing-Lung Chen, "Structural and Tree Embedding Aspects of Incomplete Hypercubes," IEEE Transactions on Computers, vol. 43, no. 12, pp. 1434-1439, Dec. 1994, doi:10.1109/12.338105
Usage of this product signifies your acceptance of the Terms of Use.