This Article 
 Bibliographic References 
 Add to: 
Traffic Analysis and Simulation Performance of Incomplete Hypercubes
July 1996 (vol. 7 no. 7)
pp. 740-754

Abstract—The incomplete hypercube with arbitrary nodes provides far better incremental flexibility than the complete hypercube, whose size is restricted to exactly a power of 2. After faults arise in a complete hypercube system, it is desirable to reconfigure the system so as to retain as many healthy nodes as possible, often leading to an incomplete hypercube of arbitrary size. In this paper, the highest traffic density over links in an incomplete hypercube under uniform message distribution is shown to be bounded by 2 (messages per link per cycle), independent of its size and despite its structural nonhomogeneity. As a result, it is easily achievable to construct an incomplete hypercube with sufficient link communication capability where any potential points of congestion are avoided, ensuring high performance. Simulation results for the incomplete hypercube reveal that mean latency for delivering messages is roughly the same in an incomplete hypercube as in a compatible complete hypercube under both packet-switching and wormhole routing. The incomplete hypercube thus appears to be an attractive and practical architecture, since it shares every advantage of complete hypercubes while eliminating the restriction on the system size.

[1] L.D. Wittie, "Communication Structures for Large Networks of Microcomputers," IEEE Trans. Computers, vol. 30, no. 4, pp. 264-273, Apr. 1981.
[2] T.-Y. Feng, "A Survey of Interconnection Networks," Computer, vol. 14, no. 12, pp. 12-27, Dec. 1981.
[3] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[4] R. Arlauskas, "iPSC/2 System: A Second Generation Hypercube," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 38-42, Jan. 1988.
[5] NCUBE Corporation, "n-Cube 2 Processor Manual," NCUBE Corporation, 1990.
[6] W.D. Hillis, The Connection Machine, MIT Press, Cambridge, Mass., 1985.
[7] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[8] H.P. Katseff, "Incomplete Hypercubes," IEEE Trans. Computers, vol. 37, no. 5, pp. 604-608, May 1988.
[9] N.-F. Tzeng, "Structural Properties of Incomplete Hypercube Computers," Proc. 10th Int'l Conf. Distributed Computing Systems, pp. 262-269, May 1990.
[10] H.P. Katseff, "Initializing Hypercubes," Proc. Ninth Int'l Conf. Distributed Computing Systems, pp. 246-253, June 1989.
[11] D.A. Reed and D.C. Grunwalk, "The Performance of Multicomputer Interconnection Networks," Computer, vol. 20, no. 6, pp. 63-73, June 1987.
[12] S. Abraham and K. Padmanabhan, "Performance of the Direct Binary n-Cube Network for Multiprocessors," IEEE Trans. Computers, vol. 38, no. 7, pp. 1000-1011, July 1989.
[13] J.-Y. Tien, C.-T. Ho, and W.-P. Yang, "Broadcasting on Incompleting Hypercubes," IEEE Trans. Computers, vol. 42, no. 11, pp. 1393-1398, Nov. 1993.
[14] Y. Lan, A.-H. Esfahanian, and L.M. Ni, "Multicast in Hypercube Multiprocessors," J. Parallel and Distributed Computing, vol. 8, pp. 30-41, Jan. 1990.
[15] A. Pombortsis and C. Halatsis, "Performance of Circuit-Switched Interconnection Networks under Nonuniform Traffic Patterns," J. Systems and Software, vol. 20, pp. 189-201, Feb. 1993.
[16] N.-F. Tzeng and H.-L. Chen, "Structural and Tree Embedding Aspects of Incomplete Hypercubes," IEEE Trans. Computers, vol. 43, no. 12, pp. 1,434-1,439, Dec. 1994.

Index Terms:
Incomplete hypercubes, mean latency, message routing, simulation, traffic density.
Nian-Feng Tzeng, Harish Kumar, "Traffic Analysis and Simulation Performance of Incomplete Hypercubes," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 7, pp. 740-754, July 1996, doi:10.1109/71.508253
Usage of this product signifies your acceptance of the Terms of Use.