This Article 
 Bibliographic References 
 Add to: 
The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems
January 1994 (vol. 5 no. 1)
pp. 17-30

Interconnection networks play a crucial role in the performance of parallel systems. Thispaper introduces a new interconnection topology that is called the hierarchical hypercube(HHC). This topology is suitable for massively parallel systems with thousands ofprocessors. An appealing property of this network is the low number of connections perprocessor, which enhances the VLSI design and fabrication of the system. Other alluringfeatures include symmetry and logarithmic diameter, which imply easy and fast algorithms for communication. Moreover, the HHC is scalable; that is it can embed HHC's of lower dimensions. The paper presents two algorithms for data communication in the HHC. The first algorithm is for one-to-one transfer, and the second is for one-to-all broadcasting. Both algorithms take O(log/sub 2/k), where k is the total number of processors in the system. A wide class of problems, the divide & conquer class (D&Q), is shown to be easily and efficiently solvable on the HHC topology. Parallel algorithms are provided to describe how a D&Q problem can be solved efficiently on an HHC structure. The solution of a D&Q problem instance having up to k inputs requires a time complexity of O(log/sub 2/k).

[1] A. El-Amawy and S. Latifi, "Properties and performance of folded hypercubes,"IEEE Trans. Parallel Distrib. Syst., vol. 2, pp. 31-42, Jan. 1991.
[2] K.V. Bhat, "On properties of arbitrary hypercubes,"Comp.&Maths with Applics., vol. 8, no. 5, pp. 339-342, 1982.
[3] S. P. Dandamudi and D. L. Eager, "Hierarchical interconnection networks for multicomputer systems,"IEEE Trans. Parallel Distrib. Syst., vol. 39, pp. 786-797, June 1990.
[4] C. M. Fiduccia, "Bussed hypercube and other pin-optimal networks,"IEEE Trans. Parallel Distrib. Syst., vol. 3, pp. 14-24, Jan. 1992.
[5] K. Hwang and J. Ghosh, "Hypernet: A communication-efficient architecture for constructing massively parallel computers,"IEEE Trans. Comput., vol. C-36, pp. 1450-1466, Dec. 1987.
[6] O. H. Ibarra and S. M. Sohn, "On mapping systolic algorithms onto the hypercube,"IEEE Trans. Parallel Distrib. Syst., vol. 1, pp. 48-63, Jan. 1990.
[7] S. L. Johnsson and. C. T. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, pp. 1249-1268, Sept. 1989.
[8] H. P. Katseff, "Incomplete hypercubes,"IEEE Trans. Comput., vol. 37, pp. 604-608, Apr. 1988.
[9] J.M. Kumar and L.M. Patnik, "Extended hypercube: A hierarchical interconnection network of hypercubes,"IEEE Trans. Parallel Distrib. Syst., vol. 3, pp. 45-57, Jan. 1992.
[10] F. P. Preparata and J. Vuillemin, "The cube-connected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300-309, May 1981.
[11] Y. Saad and M.H. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. 31, pp. 867-872, July 1988.
[12] Y. Saad and M. H. Schultz, "Data communication in hypercubes,"J. Parallel Distributed Comput., vol. 6, pp. 115-135, 1989.
[13] J. Squire and S. M. Palais, "Programming and design considerations of a highly parallel computer,"Proc. AFIP Spring Joint Comput. Conf., vol. 23, pp. 395-400, 1963.
[14] H. S. Stone, "Parallel processing with perfect shuffle,"IEEE Trans. Comput., vol. C-20, no. 2, Feb. 1971.
[15] A. S. Yousef and B. Narahari, "The banyan-hypercube networks,"IEEE Trans. Parallel Distrib. Syst., vol. 1, pp. 160-169, Apr. 1990.

Index Terms:
Index Termsparallel algorithms; computational complexity; hypercube networks; hierarchicalhypercube; interconnection topology; massively parallel systems; performance;symmetry; logarithmic diameter; one-to-one transfer; one-to-all broadcasting; divide &conquer class; parallels; time complexity
Q.M. Malluhi, M.A. Bayoumi, "The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 1, pp. 17-30, Jan. 1994, doi:10.1109/71.262585
Usage of this product signifies your acceptance of the Terms of Use.