The clustered-star graph: a new topology for large interconnection networks

The authors propose a flexible network called the clustered-star (CS) network. An (n-1)-dimensional CS of order m, denoted by CS/sub n-1//sup m/ is an n-dimensional star with (n-m) of its (n-1)-stars missing. The advantage of CS/sub n-1//sup m/ is that from the network size viewpoint, it is scalable by a factor of 1<m<n, as opposed to the (n-1)-star which is scalable only by a factor of n. Furthermore, the complete star graph with some faulty components or with some already allocated substars may result in a clustered-star network which renders the study of this new network important. Basic topological properties of CS/sub n-1//sup m/ are derived and optimal routing and broadcasting algorithms for this network are presented. It is shown that CS/sub n-1//sup m/ is hamiltonian for m=4, and m=3k, k not=2.<<ETX>>

[1]  Ivan Stojmenovic,et al.  Data communication and computational geometry on the star and pancake interconnection networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

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

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

[4]  S. Lakshmivarahan,et al.  Embedding of cycles and grids in star graphs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.