This Article 
 Bibliographic References 
 Add to: 
Hypercube Multiprocessors with Bus Connections for Improving Communication Performance
November 1995 (vol. 44 no. 11)
pp. 1338-1344

Abstract—A modified hypercube with multiple buses used as bypass routes is proposed. This is achieved by partitioning all PEs into subsets using coding theory and by connecting all PEs in each subset to a bus. The basic structure for small systems reduces the diameter to two (one on a bus plus one on a link). In the generalized structure for large systems, it is reduced to less than about one-third that of the regular hypercube.

[1] A.H. Esfahanian, L.M. Ni, and B.E. Sagan, "The Twisted n-Cube with Application to Multiprocessing," IEEE Trans. Computers, vol. 40, no. 1, pp. 88-93, Jan. 1991.
[2] T. Ishikawa,“CCT-cube: A highly parallel network featuring short diameter and few links,” Trans. Inst. of Electronics, Information, and Comm. Engineers, vol. J73-D-I, no. 6, pp. 599-602, 1990.
[3] N.-F. Tzeng and S. Wei, “Enhanced Hypercubes,” IEEE Trans. Computers, vol. 40, no. 3, pp. 284-294, Mar. 1991.
[4] A. Aggarwal,“Optimal bounds for finding maximum on array of processors withkglobal buses,” IEEE Trans. Computers, vol. 35, pp. 62-64, 1986.
[5] V.K. Prasanna Kumar, and C.S. Raghavendra,“Array processor with multiple broadcasting,” J. of Parallel and Distributed Computing, vol. 4, pp. 173-190, 1987.
[6] W.W. Peterson and E.J. Weldon Jr.,Error-Correcting Codes.Cambridge, Mass.: MIT Press 1972.
[7] 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.
[8] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[9] J.M. Rosario,“High performance parallel I/O on the nCUBE 2,” Trans. Inst. of Electronics, Information, and Comm. Engineers, vol. J75-D-I, no. 8, pp. 626-636, 1992.
[10] T. Shirakawa,T. Kageyama,H. Abe,, and T. Hoshino,“Processor array PAX-128,” Trans. Inst. of Electronics and Comm. Engineers, vol. J67-D, no. 8, pp. 853-860, 1984.
[11] H. Ishihata,T. Horie,S. Inano,T. Shimizu,, and S. Kato,“An architecture of highly parallel computer AP1000,” Proc. IEEE Pacific Rim Conf. Communications, Computers, and Signal Processing, pp. 13-16, 1991.
[12] L.N. Bhuyan and D.P. Agrawal,“Generalized hypercube and hyperbus structures for a computer network,” IEEE Trans. Computers, vol. 33, pp. 323-333, 1984.
[13] P.W. Dowd and K. Jabbour, “Spanning Multiaccess Channel Hypercube Computer Interconnection,” IEEE Trans. Computers, Vol. 37, No. 9, Sept. 1988, pp. 1137-1142.
[14] C.M. Fiduccia,“Bused hypercubes and other pin-optimal networks,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 14-24, 1992.

Index Terms:
Hypercubes, multiprocessor network, bus connection, network diameter, communication performance, routing algorithms, perfect code, Hamming code.
Tsutomu Ishikawa, "Hypercube Multiprocessors with Bus Connections for Improving Communication Performance," IEEE Transactions on Computers, vol. 44, no. 11, pp. 1338-1344, Nov. 1995, doi:10.1109/12.475131
Usage of this product signifies your acceptance of the Terms of Use.