Periodically regular chordal rings: generality, scalability, and VLSI layout

Abstract

Based on the chordal ring structure, we introduce a general framework to describe networks with periodic connection patterns. The periodically regular chordal (PRC) ring is proposed as an alternative for realizing massively parallel processors. A PRC ring consists of identical nodes that are connected cyclically via a finite set of skip links and has the desirable properties of bounded node degree and regular layout In this paper, we investigate the scalability and layout aspects of PRC rings with fixed period and chord lengths and show that they lead to linearly increasing area and constant wire length without deviating significantly from optimal architectural parameters.