A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Embedding meshes on the star graph
Journal of Parallel and Distributed Computing
Two Ranking Schemes for Efficient Computation on the Star Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group
IEEE Transactions on Computers
Embedding Complete Binary Trees into Star Networks
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Embeddings of complete binary trees into star graphs with congestion 1
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Congestion-free Dilation-2 Embedding of Full Binary Trees on Star Graphs
HIPC '96 Proceedings of the Third International Conference on High-Performance Computing (HiPC '96)
On the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Largest connected component of a star graph with faulty vertices
International Journal of Computer Mathematics
| Hi-index | 0.00 |
In this paper, we present a scheme for efficient embedding of torus of any dimension on a star graph. The dilation of the embedding is four. The expansion is small. Congestion depends upon the routing scheme used. With one routing scheme, the congestion is bound by a small constant $(\approx 2)$ with an increase in expansion cost. For a second routing scheme, the congestion is O(n), for an n-star, with bounded expansion.