DocumentCode :
2352182
Title :
D-trees: a class of dense regular interconnection topologies
Author :
Ramkumar, B. ; Kalé, L.V.
Author_Institution :
Dept. of Comput Sci., Illinois Univ., Urbana, IL, USA
fYear :
1988
fDate :
10-12 Oct 1988
Firstpage :
207
Lastpage :
210
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
Keywords :
multiprocessor interconnection networks; trees (mathematics); D-trees; dense regular interconnection topologies; n-dimensional Boolean hypercube; pancake graph; ring; star graph; Computer science; Costs; Density measurement; Hypercubes; Multiprocessor interconnection networks; Network topology; Routing; Supercomputers;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of
Conference_Location :
Fairfax, VA
Print_ISBN :
0-8186-5892-4
Type :
conf
DOI :
10.1109/FMPC.1988.47476
Filename :
47476
Link To Document :
بازگشت