A Heuristic (delta, D) Digraph to Interpolate between Hypercube and de Bruijn Topologies for Future On-Chip Interconnection Networks

The paper presents as background several graphs referred to (delta, D) digraphs including the Hypercube and de Bruijn. It shows the major disadvantages when implementing these topologies on chip interconnection networks. Then, the paper presents the "Small-World Heuristic" (SWH), which aims to find a network topology for a large number of nodes that has a maximum out degree and a small diameter, while maintaining an acceptable level of connectivity. It is proposed that this heuristic can be used to determine a compromise between Hypercube and de Bruijn when implementing networks on FPGA or in VLSI.

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

[2]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[3]  Bella Bose,et al.  Fault-Tolerant Ring Embedding in de Bruijn Networks , 1993, IEEE Trans. Computers.

[4]  Ding-Zhu Du,et al.  Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs , 1993, IEEE Trans. Computers.

[5]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[6]  Satish K. Tripathi,et al.  An Analysis of Cube-Connected Cycles and Circular Shuffle Networks for Parallel Computation , 1988, J. Parallel Distributed Comput..

[7]  M. R. Samatham,et al.  Correction to 'The De Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI' , 1991 .

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

[9]  Ronald I. Greenberg,et al.  On the area of hypercube layouts , 2001, Inf. Process. Lett..

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

[11]  Eric J. Schwabe.  On the computational equivalence of hypercube-derived networks , 1990, SPAA '90.

[12]  Matthieu De Beule,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 1999 .

[13]  Richard J. Enbody,et al.  Hypercubes Vs. 2D Meshes , 1989, SIAM Conference on Parallel Processing for Scientific Computing.

[14]  C. Y. Roger Chen,et al.  Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles , 1993, IEEE Trans. Parallel Distributed Syst..