New Designs for Dense Processor Interconnection Networks

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.