D-trees: A class of dense regular interconnection topologies

B. Ramkumar, Laxmikant V Kale

Research output: Contribution to conferencePaper

Abstract

The authors propose a class of dense regular hierarchical interconnection topologies called D-trees. These topologies are denser than interconnection networks such as the ring and the n-dimensional Boolean hypercube and compare favorably with other proposed interconnection schemes, such as the star graph and the pancake graph. In addition, the class of topologies proposed is more flexible in that both the degree and the diameter can be varied in the construction of the required topology. These topologies are also incrementally scalable in the number of nodes that can be connected. Expressions are derived for the number of nodes that can be connected in this manner and the corresponding diameters of such topologies. They are also compared with the Boolean hypercube and the star graph.

Original languageEnglish (US)
Pages207-210
Number of pages4
StatePublished - Dec 1 1988
EventProceedings: The 2nd Symposium on the Frontiers of Massively Parallel Computations - Fairfax, VA, USA
Duration: Oct 10 1988Oct 12 1988

Other

OtherProceedings: The 2nd Symposium on the Frontiers of Massively Parallel Computations
CityFairfax, VA, USA
Period10/10/8810/12/88

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ramkumar, B., & Kale, L. V. (1988). D-trees: A class of dense regular interconnection topologies. 207-210. Paper presented at Proceedings: The 2nd Symposium on the Frontiers of Massively Parallel Computations, Fairfax, VA, USA, .