论文信息 - On Embedding Rings into a Star-Related Network

On Embedding Rings into a Star-Related Network

Abstract It is shown that, in the star graph, it is always possible to form a Hamiltonian path between two nodes as long as the distance between them is odd. This result leads to the proof of Hamiltonicity for the clustered-star graph. The results can readily be used in optimal embedding of a linear array of processors (or a ring) in the star graph. The embedding problem is also solved when one or more processors are faulty in the network. The length of the linear array and the ring in this case is shown to be ( n !− m !) where m is the dimension of the smallest star graph which contains all the faulty processors.

Shahram Latifi | Nader Bagherzadeh

[1] Arun K. Somani,et al. An Efficient Sorting Algorithm for the Star Graph Interconnection Network , 1990, ICPP.

[2] Ke Qiu. The star and pancake interconnection networks: properties and algorithms , 1992 .

[3] Wilhelm Magnus,et al. Groups and Their Graphs: Contents , 1992 .

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

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

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

[7] Selim G. Akl,et al. A Parallel Algorithm for Computing Fourier Transforms on the Star Graph , 1994, IEEE Trans. Parallel Distributed Syst..

[8] S. Lakshmivarahan,et al. Embedding of cycles and Grids in Star Graphs , 1991, J. Circuits Syst. Comput..

[9] Shahram Latifi,et al. The clustered-star graph: a new topology for large interconnection networks , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[10] Howard Jay Siegel,et al. Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .

[11] 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.