Unidirectional Star Graphs
暂无分享,去创建一个
Abstract We propose an assignment of directions to the edges of the n-star graph and derive attractive properties for the resulting unidirectional star graph USn. A simple polarity function is used to define the directions of the edges. USn is shown to be strongly connected and recursively structured. The number of incoming ports of a node in USn is equal to the number of its outgoing ports (plus or minus one when n is even). The polarities of the ports of a neighboring node can be directly obtained from the polarities of the ports of the local node. These properties have allowed the design of a near optimal distributed routing algorithm as indicated by simulation results on all USn graphs with up to 362,880 nodes.
[1] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.
[2] David Hung-Chang Du,et al. Uni-directional hypercubes , 1990, Proceedings SUPERCOMPUTING '90.
[3] Khaled Day,et al. A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..