Properties and performance of the hierarchical hypercube

Interconnection networks play a crucial role in the performance of parallel systems. The paper introduces the hierarchical hypercube (HHC) interconnection topology, which is suitable for parallel systems with thousands of processors. An appealing property of this network is the low number of connections per processor which enhances the VLSI design and fabrication of the system. Other alluring features include symmetry and logarithmic diameter which imply easy and fast algorithms for communication. A wide class of problems, the Divide & Conquer class (D&Q), is easily and efficiently solvable on the HHC topology. The solution of a D&Q problem instance having up to k inputs, requires a time complexity of O(log₂ k)