D-trees: a class of dense regular interconnection topologies

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.<<ETX>>

[1]  Marvin H. Solomon,et al.  High Density Graphs for Processor Interconnection , 1981, Inf. Process. Lett..

[2]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[3]  Frank Harary,et al.  Regular graphs with given girth pair , 1983, J. Graph Theory.

[4]  I. Korn.  On (d, k) Graphs , 1967 .

[5]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[6]  Philip C. Treleaven,et al.  Computer Architectures for Artificial Intelligence , 1986, Future Parallel Computers.

[7]  Alain J. Martin,et al.  The Sneptree : A Versatile Interconnection Network , 1986, ICPP.

[8]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[9]  David A. Patterson,et al.  X-Tree: A tree structured multi-processor computer architecture , 1978, ISCA '78.

[10]  Alan J. Hoffman,et al.  On Moore Graphs with Diameters 2 and 3 , 1960, IBM J. Res. Dev..

[11]  Robert M. Keller,et al.  Simulated Performance of a Reduction-Based Multiprocessor , 1984, Computer.

[12]  S. N. Maheshwari,et al.  Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.

[13]  Larry D. Wittie,et al.  Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.

[14]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[15]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[16]  Makoto Imase,et al.  Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.

[17]  Henry D. Friedman,et al.  A Design for (d, k) Graphs , 1966, IEEE Trans. Electron. Comput..

[18]  Gérard Memmi,et al.  Some New Results About the (d, k) Graph Problem , 1982, IEEE Transactions on Computers.

[19]  Charles Delorme,et al.  Tables of Large Graphs with Given Degree and Diameter , 1982, Inf. Process. Lett..