Cayley graph connected cycles: A new class of fixed-degree interconnection networks

We introduce a new class of fixed-degree interconnection networks, called the Cayley graph connected cycles, which includes the well known cube-connected cycles as a special case. This class of networks is shown to be vertex-symmetric and maximally fault tolerant (if the given Cayley graph is maximally fault tolerant). We propose simple routing and broadcasting algorithms for these networks in general, and improve them for special types of Cayley graph connected cycles having abelian generator-sets. Furthermore, the average distance in these networks is analyzed.<<ETX>>

[1]  Arthur T. White,et al.  Permutation Groups and Combinatorial Structures , 1979 .

[2]  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).

[3]  Christos H. Papadimitriou,et al.  Bounds for sorting by prefix reversal , 1979, Discret. Math..

[4]  Burkhard Monien,et al.  Embedding one interconnection network in another , 1990 .

[5]  Shahram Latifi,et al.  The Star Connected Cycles: A Fixed-Degree Network For Parallel Processing , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[6]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

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

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

[9]  Dragan Marusic,et al.  Hamiltonian circuits in Cayley graphs , 1983, Discret. Math..

[10]  Selim G. Akl,et al.  On Some Properties and Algorithms for the Star and Pancake Interconnection Networks , 1994, J. Parallel Distributed Comput..

[11]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

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

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

[14]  Marvin H. Solomon,et al.  Dense Trivalent Graphs for Processor Interconnection , 1982, IEEE Transactions on Computers.

[15]  Dragan Marui.  Hamiltonian circuits in Cayley graphs , 1983 .

[16]  Dominique Désérable,et al.  Broadcasting in the Arrowhead Torus , 1994, Comput. Artif. Intell..

[17]  Saumyendra Sengupta,et al.  Graphs and Digraphs , 1994 .

[18]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[19]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[20]  Henk Sol,et al.  Proceedings of the 54th Hawaii International Conference on System Sciences , 1997, HICSS 2015.

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

[22]  Shahram Latifi,et al.  Average distance and routing algorithms in the star-connected cycles interconnection network , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.