A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Information Processing Letters
On the fault-diameter of the star graph
Information Processing Letters
A VLSI Architecture for Concurrent Data Structures
A VLSI Architecture for Concurrent Data Structures
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 03
Analytic performance comparison of hypercubes and star graphs with implementation constraints
Journal of Computer and System Sciences
A comparative performance analysis of n-cubes and star graphs
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
Star graph is an extensively studied Cayley graph, considered to be an attractive alternative to the popular binary cube. The rotator graphs are a set of directed Cayley graphs introduced recently. In this paper we compare the structural and algorithmic aspects of star graphs with that of rotator graphs. In the process we present some new results for star graphs and rotator graphs. We present a formula for the number of nodes at any distance from the identity permutation in star graphs. The minimum bisection width of star and rotator graphs is obtained. Partitioning and fault tolerant parameters for both star and rotator graphs are analyzed. The node disjoint parallel paths and hence the upper bound on the fault diameter of rotator graphs are presented. We compare the minimal path routing in star and rotator graphs using simulation results.