Publication 1996 Issue No. 2 - February Abstract - Embedding Star Networks into Hypercubes
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Saïd Bettayeb Articles by Bin Cong Articles by Mike Girou Articles by I. Hal Sudborough
Embedding Star Networks into Hypercubes
February 1996 (vol. 45 no. 2)
pp. 186-194
 ASCII Text x Saïd Bettayeb, Bin Cong, Mike Girou, I. Hal Sudborough, "Embedding Star Networks into Hypercubes," IEEE Transactions on Computers, vol. 45, no. 2, pp. 186-194, February, 1996.
 BibTex x @article{ 10.1109/12.485371,author = {Saïd Bettayeb and Bin Cong and Mike Girou and I. Hal Sudborough},title = {Embedding Star Networks into Hypercubes},journal ={IEEE Transactions on Computers},volume = {45},number = {2},issn = {0018-9340},year = {1996},pages = {186-194},doi = {http://doi.ieeecomputersociety.org/10.1109/12.485371},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Embedding Star Networks into HypercubesIS - 2SN - 0018-9340SP186EP194EPD - 186-194A1 - Saïd Bettayeb, A1 - Bin Cong, A1 - Mike Girou, A1 - I. Hal Sudborough, PY - 1996KW - HypercubeKW - star networkKW - embeddingKW - dilationKW - expansionKW - permutationKW - Cayley graph.VL - 45JA - IEEE Transactions on ComputersER -

Abstract—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)$.

[1] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[2] S.G. Akl and K. Qiu, "A novel routing scheme on the star and pancake networks and its applications," Parallel Computing, vol. 19, no. 1, pp. 95-101, 1993.
[3] S.G. Akl, K. Qiu, and I. Stojmenovic, "Data Communication and Computational Geometry on the Star and Pancake Interconnection Networks," Proc. Third IEEE Symp. Parallel and Distributed Systems, pp. 415-422,Dallas, Dec. 1991.
[4] S.G. Akl, K. Qiu, and I. Stojmenovic, "Fundamental algorithms for the star and pancake interconnection networks with spplications to vomputational geometry," to appear in Networks: special issue on interconnection networks and algorithms.
[5] S. Bettayeb, Z. Miller, and I.H. Sudborough, "Embedding grids into hypercubes," J. Computer and System Sciences, vol. 45, no. 3, Dec. 1992.
[6] S.N. Bhatt, F.R.K. Chung, F.T. Leighton, and A.L. Rosenberg, "Efficient Embeddings of Trees in Hypercubes," SIAM J. Computing, vol. 21, no. 1, pp. 151-162, 1992.
[7] S. Bhatt,F. Chung,J.-W. Hong,T. Leighton,, and A. Rosenberg,“Optimal simulations by butterfly networks,” Proc. 20th Ann. ACM Symp. Theory of Computing, pp. 192-204, May 1988.
[8] B. Cong, Z. Miller, and I.H. Sudborough, "Optimum simulation of meshes by small hypercubes," Proc. Sixth Int'l MYCS,Smolenice, Czechoslovakia, Springer-Verlag, Lecture Notes in Computer Science, vol 464, pp. 30-46, Nov. 1990.
[9] K. Day and A. Tripathi, "A Comparative Study of Topological Properties of Hypercubes and Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 31-38, Jan. 1994.
[10] M. Dietzfelbinger, S. Madhavapeddy, and I.H. Sudborough, "Three disjoint path paradigms in star networks," Proc. Third IEEE Symp. Parallel and Distributed Processing, pp. 400-406, 1991.
[11] M. Fellows, "Encoding graphs in graphs," PhD dissertation, Dept. of Computer Science, Univ. of California, San Diego, 1985.
[12] D. Hoelzeman and S. Bettayeb, "On the genus of star graphs," \it IEEE Trans. Computers, vol. 43, no. 6, pp. 755-759, June 1994
[13] J.-S. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embeddings of Cycles and Grids in Star Graphs," Proc. Symp. Parallel and Distributed Processing, pp. 540-547, 1990.
[14] S. Latifi and N. Nader, "Incomplete star graphs: An alternative interconnection network for massively parallel systems," Proc. 26th Hawaii Int'l Conf. Systems Sciences, 1992.
[15] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[16] Z. Miller, D. Pritikin, I.H. Sudborough, "Near embeddings of hypercubes into Cayley graphs on the symmetric group," IEEE Trans. Computers, vol. 43, no. 1, pp. 13-22, Jan. 1994.
[17] V.E. Mendia and D. Sarkar, “Optimal Broadcasting in the Star Graph,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 389-396, July 1992.
[18] A. Menn and A.K. Somani, "An efficient sorting algorithm for the star graph," Proc. Int'l Conf. Parallel Processing, pp. 1-8, 1990.
[19] J. Misic and Z. Jovanovic, "Communication Aspects of the Star Graph Interconnection Network," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 7, pp. 678-687, July 1994.
[20] B. Monien and I.H. Sudborough, "Simulating binary trees on hypercubes," Proc. '88 AWOC VLSI Algorithms and Architectures Conf., Springer Verlag, Lecture Notes in Computer Science, vol. 319, pp. 170- 180, July 1988.
[21] M. Nigam, S. Sahni, and B. Krishnamurthy, "Embedding Hamiltonians and hypercubes in star interconnection graphs," Proc. Int'l Conf. Parallel Processing, 1990.
[22] K. Qiu and S.G. Akl, "Load balancing, selection and sorting on the star and pancake networks," to appear in J. Parallel Algorithms and Architectures.
[23] K. Qiu, S.G. Akl, and H. Meijer, "On Some Properties and Algorithms for the Star and Pancake Interconnection Networks," J. Parallel and Distributed Computing, vol. 22, pp. 16-25, 1994.
[24] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[25] X. Shen, Q. Hu, B. Cong, H. Sudborough, M. Girou, and S. Bettayeb, "The 4-star graph is not a subgraph of any hypercube," Information Processing Letters, vol. 45, pp. 199-203, 1993.
[26] S. Sur and P.K. Srimani, "A fault-tolerant routing algorithm in star graphs," Proc. Int'l Conf. Parallel Processing, pp. 267-270, 1991.
[27] H.P. Yap, "Symmetries of graphs," Some Topics in Graph Theory, London Mathematical Society Lecture Note Series; no. 108, Cambridge Univ. Press, 1986.

Index Terms:
Hypercube, star network, embedding, dilation, expansion, permutation, Cayley graph.
Citation:
Saïd Bettayeb, Bin Cong, Mike Girou, I. Hal Sudborough, "Embedding Star Networks into Hypercubes," IEEE Transactions on Computers, vol. 45, no. 2, pp. 186-194, Feb. 1996, doi:10.1109/12.485371