On the hierarchical hypercube interconnection network
The paper explores the hierarchical hypercube (HHC) interconnection network, suitable for building massively parallel systems with thousands of processors. HHC is self-embedded, that is, an HHC can embed HHCs of lower dimensions. In addition, HHC is a communication-efficient architecture. Two algorithms for data communication in the HHC are presented. The first algorithm is for one-to-one transfer and the second is for one-to-all broadcasting. Both algorithms take O(log k), where, k is the total number of processors in the system. Moreover, the paper shows that the HHC VLSI layout has a relatively small area which is O((log log k).k/sup 2//log k).<<ETX>>