TCN: Scalable Hierarchical Hypercubes

  • Authors:
  • Affiliations:
  • Venue:
  • ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hierarchical hypercubes, such as Extended Hypercube(EH), Hyperweave (HW), and Extended Hypercube withCross Connections (EHC), have been proposed toovercome the scalability limitation of conventionalhypercubes through the use of fixed dimension hypercubesof processing elements (PEs) as basic modulesinterconnected by network controllers (NC) which arethemselves interconnected into hypercubes. The scalabilityof all these three hierarchical hypercube networks is stilllimited, because the average network communication loadin each NC increases as the number of interconnected PEsbecome very large. In this work, a generalization scheme isproposed for improving network scalability, namelyTransformer Cube Network (TCN). For illustrationpurpose, generalized TCN is presented only for EH, thoughthe same scheme can be applied to HW and EHC as well.Several characteristics of TCN, such as topologicalproperties, message routing complexity, fault tolerance,and scalability are analyzed. We present a communicationalgorithm for one-to-one message passing in a fault-freecase. Further, the application of TCN to a class ofdivide-and-conquer problems is shown to have a timecomplexity of O(log2N), where N is the total number of PEs.