Issue No. 05 - May (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.4611
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
interconnection topology; k-dimensional hypercube; incomplete hypercubes; routing; broadcast algorithms; deadlock-free; multiprocessor interconnection networks.
H. Katseff, "Incomplete Hypercubes," in IEEE Transactions on Computers, vol. 37, no. , pp. 604-608, 1988.