Hierarchical Cubic Networks

  • Authors:
  • Kanad Ghose;Kiran R. Desai

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 1995

Quantified Score

Hi-index 0.01

Visualization

Abstract

We introduce a new interconnection network for large-scale distributed memory multiprocessors called the Hierarchical Cubic Network (HCN). We establish that the number of routing steps needed by several data parallel applications running on a HCN-based system and a hypercube-based system are about identical. Further, hypercube connections can be emulated on the HCN in constant time. Simulation of uniform and localized traffic patterns reveal that the normalized average internode distances in a HCN are better than in a comparable hypercube. Additionally, the HCN also has about three-fourths the diameter of a comparable hypercube, although it uses about half as many links per node驴a fact that has positive ramifications on the implementation of HCN-connected systems.Index Terms驴Data parallel algorithm, hypercubes, interconnection networks, loosely-coupled multiprocessors.