This Article 
 Bibliographic References 
 Add to: 
Incomplete Hypercubes
May 1988 (vol. 37 no. 5)
pp. 604-608
Since a k-dimensional hypercube has 2/sup k/ vertices, these systems are restricted to having exactly 2/sup k/ computing nodes. Because system sizes must be a power of two, there are large gaps in the sizes of systems that can be built with hypercubes. Routing and broadcast algorithms are presented for hypercubes that are missing certain of their nodes, called incomplete hypercubes. Unlike hype

[1] J. Squire and S. M. Palais, "Programming and design considerations of a highly parallel computer," inProc. AFIP Spring Joint Comput. Conf., vol. 23, 1963, pp. 395-400.
[2] 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.
[3] E. P. DeBenedictis, "A communications operating system for the homogeneous machine," Tech. Rep. 4707, Dep. Comput. Sci., California Instit. Technol., Pasadena, CA, Jan. 1982.
[4] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[5] Intel Corp., "A new direction in scientific computing," Order 28009- 001, Beaverton, OR, 1985.

Index Terms:
interconnection topology; k-dimensional hypercube; incomplete hypercubes; routing; broadcast algorithms; deadlock-free; multiprocessor interconnection networks.
H.P. Katseff, "Incomplete Hypercubes," IEEE Transactions on Computers, vol. 37, no. 5, pp. 604-608, May 1988, doi:10.1109/12.4611
Usage of this product signifies your acceptance of the Terms of Use.