The higher radix hypercube as an interconnection and virtual network

  • Authors:

  • T.-C. Lin;P. Gupta

  • Affiliations:

  • Computer Science Engineering Department, The University of Texas at Arlington, Arlington, Texas;Computer Science Engineering Department, The University of Texas at Arlington, Arlington, Texas

  • Venue:
  • CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

The HIGHER RADIX HYPERCUBE (HRH) is investigated in this paper as an interconnection network for multiprocessors as well as a virtual network. The HRH is based on a radix higher than two, the radix for the hypercube. We have compared several topological parameters' for the HRH with the hypercube. It can be seen that HRH provides smaller diameter for a small price. A mapping and a partitioning algorithms are proposed for mapping different topologies to the HRH. In our algorithm, we first map the problem topology to a virtual HRH, which is the most natural HRH for the problem. The virtual HRH is then transformed into the actual topology. This algorithm is applicable to HRH used either as an interconnection or a virtual network. The partitioning algorithm reduces a large application topology to the required size by the iterative reduction process. Three examples of mapping topologies onto the HRH are also presented.