Issue No. 05 - September (1992 vol. 3)

ISSN: 1045-9219

pp: 622-626

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.159045

ABSTRACT

Rotator graphs, a set of directed permutation graphs, are proposed as an alternative to star and pancake graphs. Rotator graphs are defined in a way similar to the recently proposed Faber-Moore graphs. They have smaller diameter, n-1 in a graph with n factorial vertices, than either the star or pancake graphs or the k-ary n-cubes. A simple optimal routing algorithm is presented for rotator graphs. The n-rotator graphs are defined as a subset of all rotator graphs. The distribution of distances of vertices in the n-rotator graphs is presented, and the average distance between vertices is found. The n-rotator graphs are shown to be optimally fault tolerant and maximally one-step fault diagnosable. The n-rotator graphs are shown to be Hamiltonian, and an algorithm for finding a Hamiltonian circuit in the graphs is given.

INDEX TERMS

Index Termstopology; point-to-point multiprocessor networks; directed permutation graphs; Faber-Moore graphs; optimal routing algorithm; rotator graphs; fault tolerant; one-step fault diagnosable; Hamiltonian circuit; directed graphs; multiprocessor interconnection networks

CITATION

P.F. Corbett, "Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks",

*IEEE Transactions on Parallel & Distributed Systems*, vol. 3, no. , pp. 622-626, September 1992, doi:10.1109/71.159045