New Designs for Dense Processor Interconnection Networks

Authors:
K. W. Doty
Affiliations:
The Aerospace Corporation
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 4
Cited 2

Analysis of Chordal Ring Network

IEEE Transactions on Computers
Improved Construction Techniques for (d, k) Graphs

IEEE Transactions on Computers
Topological constraints on interconnection-limited logic

SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
On Moore graphs with diameters 2 and 3

IBM Journal of Research and Development

Comparing the Performance Parameters of Two Network Structures for Scalable Massively Parallel Processors

MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Complete catalogue of graphs of maximum degree 3 and defect at most 4

Discrete Applied Mathematics

Quantified Score

Hi-index	14.98

Visualization

Abstract

Distributed computer systems can be modeled using graph theory to evaluate potential network topologies. A good network from a communication standpoint should have a small diameter because this allows all pairs of processors to communicate quickly. This paper presents a new construction method for interconnection networks, which is a generalization of the chordal ring networks of Arden and Lee. The graphs produced by this method are the largest known for many degrees and diameters.