This Article 
 Bibliographic References 
 Add to: 
Broadcasting on Incomplete Hypercubes
November 1993 (vol. 42 no. 11)
pp. 1393-1398

Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. The authors devise and analyze a broadcasting algorithm based on edge-disjoint spanning trees in an incomplete hypercube of 2/sup n/+2/sup k/ nodes, where 0>or=k>n. The broadcasting algorithm is strictly optimal.

[1] J. Aubert and B. Schneider, "Decomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens,"Discrete Math., vol. 38, pp. 7-16, 1982.
[2] H. L. Chen and N.-F. Tzeng, "Enhanced incomplete hypercube," inProc. 1989 Int. Conf. Parallel Process., vol. 1, pp. 270-277, 1989.
[3] M. Foregger, "Hamiltonian decompositions of products of cycles,"Descrete Math., vol. 24, pp. 251-260, 1978.
[4] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[5] C.-T. Ho, "Optimal communication primitives and graph embeddings on hypercubes," Ph.D. dissertation, Yale Univ., May 1990.
[6] C.-T. Ho, "Optimal broadcasting on SIMD hypercubes without indirect addressing capability,"J. Parallel Distrib. Comput., 1991.
[7] C.-T. Ho and S. L. Johnsson, "Distributed routing algorithms for broadcasting and personalized communication in hypercubes," inProc. 1986 Int. Conf. Parallel Process., 1986, pp. 640-648.
[8] S. L. Johnsson and C.-T. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, pp. 1249-1268, Sept. 1989.
[9] S. L. Johnsson and C.-T. Ho, "Embedding meshes into small Boolean cubes," inProc. 1990 Distrib. Memory Comput. Conf., 1990, pp. 1366-1374.
[10] H. P. Katseff, "Incomplete hypercubes,"IEEE Trans. Comput., vol. 37, pp. 604-608, May 1988.
[11] Y. Saad and M. H. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. 37, pp. 867-872, July 1988.
[12] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[13] Q. Stout and B. Wagar, "Intensive hypercube communication, prearranged communication in link-bound machines,"J. Parallel Distributed Comput., vol. 10, pp. 167-181, 1990.
[14] H. Sulivan and T. R. Bashkov, "A large scale homogeneous, fully distributed parallel machine, I," inProc. 4th Symp. Comput. Arch., March 1977, pp. 105-117.
[15] J.-Y. Tien and W.-P. Yang, "Hierarchical spanning trees and distributing on incomplete hypercubes,"Parallel Comput., vol. 17, pp. 1343-1360, 1991.
[16] N.-F. Tzeng, "Structural properties of incomplete hypercube computers," inProc. 10th IEEE Int. Conf. Distrib. Computing Syst., May 1990, pp. 262-269.
[17] N.-F. Tzeng, H.-L. Chen, and P.-J. Chuang, "Embeddings in incomplete hypercubes," inProc. 1990 Int. Conf. Parallel Process., 1990, pp. 335-339.

Index Terms:
incomplete hypercube; faulty nodes; broadcasting algorithm; edge-disjoint spanning trees; delays; hypercube networks; trees (mathematics).
Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang, "Broadcasting on Incomplete Hypercubes," IEEE Transactions on Computers, vol. 42, no. 11, pp. 1393-1398, Nov. 1993, doi:10.1109/12.247842
Usage of this product signifies your acceptance of the Terms of Use.