Communications of the ACM - Special section on computer architecture
Some topics in graph theory
Simulating binary trees on hypercubes
VLSI Algorithms and Architectures
Optimal simulations by Butterfly Networks
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Efficient embeddings of trees in hypercubes
SIAM Journal on Computing
The 4-star graph is not a subgraph of any hypercube
Information Processing Letters
Embedding grids into hypercubes
Journal of Computer and System Sciences
On some properties and algorithms for the star and pancake interconnection networks
Journal of Parallel and Distributed Computing
Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group
IEEE Transactions on Computers
IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph
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
Communication Aspects of the Star Graph Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Optimum Simulation of Meshes by Small Hypercubes
Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science
Optimally Balanced Spanning Tree of the Star Network
IEEE Transactions on Computers
A faster algorithm for solving linear algebraic equations on the star graph
Journal of Parallel and Distributed Computing
Exact wirelength of hypercubes on a grid
Discrete Applied Mathematics
Hi-index | 14.98 |
The star interconnection network has recently been suggested as an alternative to the hypercube. As hypercubes are often viewed as universal and capable of simulating other architectures efficiently, we investigate embeddings of star network into hypercubes. Ourt embeddings exhibit a marked trade-off between dilation and expansion. For the n-dimensional star network we exhibit: 1) a dialtion N驴 1 embedding of Sn into HN, where $N=\left\lceil {\log _2(n! )} \right\rceil $, 2) a dilation 2(d + 1) embedding of Sn into $H_{2d+n-1}$, where $d=\left\lceil {\log _2(\left\lceil {{n \mathord{\left/ {\vphantom {n 2}} \right. \kern-\nulldelimiterspace} 2}} \right\rceil !)} \right\rceil $, 3) a dilation 2d + 2i embedding of $S_{2^im}$ into $H_{2^i\,d+i2^i\,m-2i+1}$, where $d=\left\lceil {\log _2(m\ !)} \right\rceil $, 4) a dilation L embedding of Sn into Hd, where $L=1+\left\lfloor {\log _2(n\ !)} \right\rfloor $, and d = (n驴 1)L, 5) a dilation $(k+1){{(k+2)} \mathord{\left/ {\vphantom {{(k+2)} 2}} \right. \kern-\nulldelimiterspace} 2}$ embedding of Sn into $H_{n(k+1)-2^{k+1}\,+1}$, where $k=\left\lfloor {\log _2(n-1)} \right\rfloor $, 6) a dilation 3 embedding of $S_{2k+1}$ into $H_{2k^2\,+k}$, and 7) a dilation 4 embedding of $S_{3k+2}$ into $H_{3k^2\,+3k+1}$.Some of the embeddings are, in fact, optimum, in both dilation and expansion for small values of n. We also show that the embedding of Sn into its optimum hypercube requires dilation $\Omega (\log _2n)$.