Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Periodically Regular Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
Topological Properties of OTIS-Networks
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
The RTCC-pyramid: A Versatile Pyramid network
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
The triangular pyramid: Routing and topological properties
Information Sciences: an International Journal
Some properties of WK-recursive and swapped networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
| Hi-index | 0.00 |
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.