The Star Connected Cycles: A Fixed-Degree Network For Parallel Processing

This paper introduces a new interconnec tion network for massively parallel systems referred to as star connected cycles (SCC) graph. The SCC presents a fixed degree structure that results in several advantages over variable degree graphs like the star graph and the n-cube. The description of the SCC graph given in this paper in cludes issues such as labeling of nodes, degree, diameter, symmetry, fault tolerance and Cayley graph representation. The paper also presents an optimal routing algorithm for the SCC and a comparison with other interconnection net works. Our results indicate that for even n, an n-SCC and a CCC of similar sizes have about the same diameter.