Topological properties of incomplete WK-recursive networks

WK-recursive networks, which were originally proposed by Vecchia and Sanges (1988), have suffered from the rigorous restriction of the number of nodes. Like other incomplete networks, incomplete WK-recursive networks are proposed to relieve this restriction. It is first shown that the structures of the incomplete WK-recursive networks are conveniently represented with multistage graphs. This representation can provide a uniform look at the incomplete WK-recursive networks. Using this they: (1) compute the connectivities of the incomplete WK-recursive networks; (2) show that they are Hamiltonian if their connectivities are greater than one; and (3) propose a sufficient and necessary condition for a Hamiltonian path in an incomplete WK-recursive network with connectivity 1.

[1]  Frank Harary,et al.  Distance in graphs , 1990 .

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

[3]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[4]  Arkady Kanevsky,et al.  Embedding rings in recursive networks , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[5]  Howard P. Katseff,et al.  Incomplete Hypercubes , 1988, IEEE Trans. Computers.

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

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

[8]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[9]  Ronald Fernandes,et al.  Recursive Interconnection Networks for Multicomputer Networks , 1992, International Conference on Parallel Processing.

[10]  Arkady Kanevsky,et al.  Hierarchical WK-Recursive Topologies for Multicomputer Systems , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[11]  P. F. Corbett,et al.  Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks , 1992, IEEE Trans. Parallel Distributed Syst..

[12]  C. Sanges,et al.  An optimized broadcasting technique for WK-recursive topologies , 1990, Future Gener. Comput. Syst..

[13]  Arkady Kanevsky,et al.  Substructure Allocation in Recursive Interconnection Networks , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[14]  C. Sanges,et al.  A recursively scalable network VLSI implementation , 1988, Future Gener. Comput. Syst..

[15]  Arkady Kanevsky,et al.  Efficient Routing and Broadcasting in Recursive Interconnection Networks , 1994, 1994 International Conference on Parallel Processing Vol. 1.

[16]  Gen-Huey Chen,et al.  Topological Properties of WK-Recursive Networks , 1994, J. Parallel Distributed Comput..

[17]  C. P. Ravikumar,et al.  Incomplete Star Graph : An Economical Fault-tolerant Interconnection Network , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[18]  Vipin Chaudhary,et al.  Embedding of cycles in rotator and incomplete rotator graphs , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[19]  Shahram Latifi,et al.  Incomplete Star: An Incrementally Scalable Network Based on the Star Graph , 1994, IEEE Trans. Parallel Distributed Syst..

[20]  Gen-Huey Chen,et al.  Topological properties, communication, and computation on WK-recursive networks , 1994, Networks.