论文信息 - A new class of interconnection networks based on alternating group

A new class of interconnection networks based on alternating group

The authors present an analysis of a new class of interconnection scheme based on the Cayley graph of the alternating group. The definition and an analysis of the symmetry of this class of graphs are presented, and a shortest-path routing algorithm is given. An algorithm for embedding of the Hamiltonian cycle is presented, and an algorithm for embedding grids is given. A greedy spanning tree algorithm for one source broadcasting and an analysis of the contention problem are also given.<<ETX>>

Jung-Sing Jwo | S. Lakshmivarahan | S. Dhall | J. Jwo

[1] S. Lakshmivarahan,et al. Analysis and design of parallel algorithms , 1990 .

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

[3] Douglas M. Pase. Contention and the star graph as a network topology , 1988 .

[4] Norman Biggs. Algebraic Graph Theory: Index , 1974 .

[5] S. Lakshmivarahan,et al. A new class of interconnection networks based on the alternating group , 1993, Networks.

[6] S. Lakshmivarahan,et al. Characterization of node disjoint (parallel) path in star graphs , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

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

[8] Sartaj Sahni,et al. Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs , 1990, ICPP.

[9] Herbert S. Wilf,et al. Combinatorial Algorithms: An Update , 1987 .