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.

[1]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  M. Krishnamoorthy,et al.  Fault diameter of interconnection networks , 1987 .

[3]  Frank Harary,et al.  Graph Theory , 2016 .

[4]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[5]  Walter Ledermann,et al.  Introduction to the theory of finite groups , 1949 .

[6]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[7]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[8]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[9]  Shahram Latifi.  Parallel Dimension Permutations on Star-Graph , 1993, Architectures and Compilation Techniques for Fine and Medium Grain Parallelism.

[10]  Shahram Latifi.  Combinatorial Analysis of the Fault-Diameter of the n-cube , 1993, IEEE Trans. Computers.

[11]  C. Y. Roger Chen,et al.  Communication Aspects of the Cube Connected Cycles , 1990, ICPP.

[12]  S. Lakshmivarahan,et al.  Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey , 1993, Parallel Comput..

[13]  R. Sarnath,et al.  Proceedings of the International Conference on Parallel Processing , 1992 .

[14]  Khaled Day,et al.  A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..

[15]  Shahram Latifi.  On the Fault-Diameter of the Star Graph , 1993, Inf. Process. Lett..