Comments on "Reliable Loop Topologies for Large Local Computer Networks"
IEEE Transactions on Computers
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
The Computer Journal
The Cubical Ring Connected Cycles: A Fault Tolerant Parallel Computation Network
IEEE Transactions on Computers
Locality, communication, and interconnect length in multicomputers
SIAM Journal on Computing
Routing for generalized chordal rings
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Chordal rings as fault-tolerant loops
Discrete Applied Mathematics - Special double volume: interconnection networks
CSC '94 Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
Horizons of parallel computation
Journal of Parallel and Distributed Computing
Distributed loop computer networks: a survey
Journal of Parallel and Distributed Computing
A Combinatorial Problem Related to Multimodule Memory Organizations
Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Cost-Performance Trade-Offs in Manhattan Street Network Versus 2-D Torus
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles
IEEE Transactions on Parallel and Distributed Systems
Highly Reliable Symmetric Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Periodically regular chordal ring networks for massively parallel architectures
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Periodically Regular Chordal Rings: Generality, Scalability, and VLSI Layout
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Incomplete k-ary n-cube and its derivatives
Journal of Parallel and Distributed Computing
The recursive transpose-connected cycles (RTCC) interconnection network for multiprocessors
Proceedings of the 2005 ACM symposium on Applied computing
IEEE Transactions on Parallel and Distributed Systems
Swapped interconnection networks: Topological, performance, and robustness attributes
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
A universal performance factor for multi-criteria evaluation of multistage interconnection networks
Future Generation Computer Systems - Systems performance analysis and evaluation
Reducing the Height of Independent Spanning Trees in Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
Information Processing Letters
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
Chordal rings have been proposed in the past as networks that combine the simple routing framework of rings with the lower diameter, wider bisection, and higher resilience of other architectures. Virtually all proposed chordal ring networks are node-symmetric, i.e., all nodes have the same in/out degree and interconnection pattern. Unfortunately, such regular chordal rings are not scalable. In this paper, periodically regular chordal (PRC) ring networks are proposed as a compromise for combining low node degree with small diameter. By varying the PRC ring parameters, one can obtain architectures with significantly different characteristics (e.g., from linear to logarithmic diameter), while maintaining an elegant framework for computation and communication. In particular, a very simple and efficient routing algorithm works for the entire spectrum of PRC rings thus obtained. This flexibility has important implications for key system attributes such as architectural scalability, software portability, and fault tolerance. Our discussion is centered on unidirectional PRC rings with in/out-degree of 2. We explore the basic structure, topological properties, optimization of parameters, VLSI layout, and scalability of such networks, develop packet and wormhole routing algorithms for them, and briefly compare them to competing fixed-degree architectures such as symmetric chordal rings, meshes, tori, and cube-connected cycles.