“School of Computer Science”
Back to Papers HomeBack to Papers of School of Computer Science
| Paper IPM / Computer Science / 11113 |
|
||||||
| Abstract: | |||||||
|
In this paper, we propose a new modular topology for interconnection networks, the Recursive Transpose-Connected Cycles (RTCC). The RTCC has a recursive definition quite similar to that of fractal graphs having interesting topological characteristics, making it suitable for utilization as the base topology of large-scale multicomputer interconnection networks. We study important properties of this topology such as diameter, bisection width and issues related to implementation, such as routing algorithms and the average message latency under VLSI layout constraints. In addition, we prove that the RTCC is a Hamiltonian graph. We conclude that, insight of most of the above-mentioned properties, the RTCC is superior to conventional topologies such as the mesh and k-ary n-cube.
Download TeX format |
|||||||
| back to top | |||||||
