This Article 
 Bibliographic References 
 Add to: 
Enhanced Hypercubes
March 1991 (vol. 40 no. 3)
pp. 284-294

A hypercube with extra connections added between pairs of nodes through otherwise unused links is investigated. The extra connections are made in a way that maximizes the improvement of the performance measure of interest under various traffic distributions. The resulting hypercube, called the enhanced hypercube, requires a simple routing algorithm and is guaranteed not to create any traffic-congested points or links. The enhanced hypercube achieves noticeable improvement in diameter, mean internode distance, and traffic density, and it also is more cost effective than a regular hypercube. An efficient broadcast algorithm that can considerably speed up the broadcast process in enhanced hypercubes is provided.

[1] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[2] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[3] Intel Corporation,iPSC System Overview, Jan. 1986.
[4] J. P. Hayes, T. N. Mudge, and Q. F. Stout, "Architecture of a hypercube supercomputer," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 653-660.
[5] W. C. Athas and C. L. Seitz, "Multicomputers: Message-passing concurrent computers,"IEEE Comput. Mag., vol. 21, pp. 9-24, Aug. 1988.
[6] L. W. Tucker and G. G. Robertson, "Architecture and applications of the Connection Machine,"IEEE Comput. Mag., vol. 21, pp. 26-38, Aug. 1988.
[7] W. T.-Y. Hsu, P.-C. Yew, and C.-Q. Zhu, "An enhancement scheme for hypercube interconnection networks," inProc. 1987 Int. Conf. Parallel Processing, Aug. 1987, pp. 820-823.
[8] D. A. Reed and D. C. Grunwald, "The performance of multicomputer interconnection networks,"IEEE Comput. Mag., vol. 20, pp. 63-73, June 1987.
[9] 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.
[10] D. A. Reed and H. D. Schwetman, "Cost-performance bounds for multimicrocomputer networks,"IEEE Trans. Comput., vol. C-32, pp. 83-95, Jan. 1983.
[11] L. D. Wittie, "Communication structures for large networks of microcomputers,"IEEE Trans. Comput., vol. C-30, pp. 264-273, Apr. 1981.
[12] P. W. Dowd and K. Jabbour, "Spanning multiaccess channel hypercube computer interconnection,"IEEE Trans. Comput., vol. C-37, pp. 1137-1142, Sept. 1988.
[13] L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., vol. C-33, pp. 323-333, Apr. 1984.
[14] J. P. Hayeset al., "A microprocessor-based hypercube supercomputer,"IEEE Micro, vol. 6, pp. 6-17, Oct. 1986.
[15] J. C. Petersonet al., "The Mark III hypercube-ensemble concurrent computer," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 71-73.
[16] A. Esfahanian, L. M. Ni, and B. E. Sagan, "On enhancing hypercube multiprocessors," inProc. 1988 Int. Conf. Parallel Processing, Aug. 1985, pp. 86-89.
[17] D. P. Agrawalet al., "Evaluating the performance of multicomputer configurations,"IEEE Comput. Mag., vol. 19, pp. 23-37, May 1986.
[18] S. L. Johnsson and C.-T. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, pp. 1249-1268, Sept. 1989.
[19] L. Lamport, R. Shostak, and M. Pease, "The Byzantine Generals Problem,"ACM Trans. Programming Languages and Systems, Vol. 4, No. 3, July 1982, pp. 382-401.
[20] T.K. Srikanth and S. Toueg, "Optimal Clock Synchronization,"J. ACM, Vol. 34, No. 3, July 1987, pp. 626-645.

Index Terms:
node pairs; connections; unused links; performance measure; traffic distributions; enhanced hypercube; algorithm; diameter; mean internode distance; traffic density; broadcast algorithm; hypercube networks; performance evaluation.
N.-F. Tzeng, S. Wei, "Enhanced Hypercubes," IEEE Transactions on Computers, vol. 40, no. 3, pp. 284-294, March 1991, doi:10.1109/12.76405
Usage of this product signifies your acceptance of the Terms of Use.