Characterization of parallel paths in arrangement graphs

In this paper we fully characterize node-disjoint (parallel) paths in arrangement graph interconnection networks which have been presented as generalized star graphs for interconnecting large multiprocessor systems. We characterize complete families of parallel paths between any two nodes of an arrangement graph. The length of each path is at most four plus the minimum distance between the two nodes.

[1]  Khaled Day,et al.  Unidirectional Star Graphs , 1993, Inf. Process. Lett..

[2]  Jang-Ping Sheu,et al.  A Broadcasting Algorithm in Star Graph Interconnection Networks , 1993, Inf. Process. Lett..

[3]  Pradip K. Srimani,et al.  Network resilience of star graphs: a comparative analysis , 1991, CSC '91.

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

[5]  Luisa Gargano,et al.  Fault Tolerant Routing in the Star and Pancake Interconnection Networks , 1993, Inf. Process. Lett..

[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.  Characterization of node disjoint (parallel) path in star graphs , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

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

[10]  Sanguthevar Rajasekaran,et al.  Selection, Routing, and Sorting on the Star Graph , 1997, J. Parallel Distributed Comput..

[11]  S.W. Graham,et al.  The Cost of Broadcasting on Star Graphs and k-Ary Hypercubes , 1993, IEEE Trans. Computers.

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

[13]  Khaled Day,et al.  Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..

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

[15]  Sanjay Ranka,et al.  Embedding meshes on the star graph , 1990, Proceedings SUPERCOMPUTING '90.

[16]  Kris Coolsaet,et al.  Optimal data exchange algorithms on star graphs , 1994 .

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

[18]  Selim G. Akl,et al.  Load balancing and selection on the star and pancake interconnection networks , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[19]  Qing Hu,et al.  The 4-Star Graph is not a Subgraph of Any Hypercube , 1993, Inf. Process. Lett..

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

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

[22]  Shahram Latifi,et al.  A Routing and Broadcasting Scheme on Faulty Star Graphs , 1993, IEEE Trans. Computers.

[23]  Pradip K. Srimani,et al.  Fault Diameter of Star Graphs , 1993, Inf. Process. Lett..

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

[25]  D. Tang.  Incomplete Star: An Incrementally Scalable Network Based on the Star Graph , 1994 .