Computer Interconnection Structures: Taxonomy, Characteristics, and Examples
ACM Computing Surveys (CSUR)
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Modeling of multi-microcomputer networks
Modeling of multi-microcomputer networks
Processor Interconnection Strategies
IEEE Transactions on Computers
IEEE Transactions on Computers
Reconfiguration Procedures for a Polymorphic and Partitionable Multiprocessor
IEEE Transactions on Computers
Discrete Optimization Problem in Local Networks and Data Alignment
IEEE Transactions on Computers
Flexible oblivious router architecture
IBM Journal of Research and Development
A family of network topologies with multiple loops and logarithmic diameter
Parallel Computing
Cyclic Networks: A Family of Versatile Fixed-Degree Interconnection Architectures
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Edge-Bisection of Chordal Rings
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Optical Backbones with Low Connectivity for IP-over-WDM Networks
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part I
Dihamiltonian Decomposition of Regular Graphs with Degree Three
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
ICN '01 Proceedings of the First International Conference on Networking-Part 1
All-to-All Personalized Communication Algorithms in Chordal Ring Networks
ICN '01 Proceedings of the First International Conference on Networking-Part 2
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
Reducing the Height of Independent Spanning Trees in Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
Supersystems: Technology and Architecture
IEEE Transactions on Computers
New Designs for Dense Processor Interconnection Networks
IEEE Transactions on Computers
Torus and Other Networks as Communication Networks With Up to Some Hundred Points
IEEE Transactions on Computers
A Fault-Tolerant Communication Architecture for Distributed Systems
IEEE Transactions on Computers
Improved upper and lower bounds on the optimization of mixed chordal ring networks
Information Processing Letters
Global data computation in chordal rings
Journal of Parallel and Distributed Computing
Hierarchical logical topology in WDM ring networks with limited ADMs
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Twister networks and their applications to load-balanced switches
INFOCOM'10 Proceedings of the 29th conference on Information communications
Hypercube communications on optical chordal ring networks with chord length of three
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
On reliability analysis of forward loop forward hop networks
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Research note: Analysis of 1-ROR networks
Computer Communications
Bandwidth reservation for bursty traffic in the presence of resource availability uncertainty
Computer Communications
| Hi-index | 15.00 |
A family of regular graphs of degree 3, called Chordal Rings, is presented as a possible candidate for the implementation of a local network of message-connected (micro) computers. For a properly constructed graph in this family having n nodes the diameter, or maximum length message path, is shown to be of 0(n 1/2). The symmetry of the graphs makes it possible to determine message routing by using a simple distributed algorithm. The given algorithm is also potentially useful for the determination of alternate paths in the event of node or link failure.