
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
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. 186194, 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 = {00189340}, year = {1996}, pages = {186194}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.485371}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Embedding Star Networks into Hypercubes IS  2 SN  00189340 SP186 EP194 EPD  186194 A1  Saïd Bettayeb, A1  Bin Cong, A1  Mike Girou, A1  I. Hal Sudborough, PY  1996 KW  Hypercube KW  star network KW  embedding KW  dilation KW  expansion KW  permutation KW  Cayley graph. VL  45 JA  IEEE Transactions on Computers ER   
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 tradeoff between dilation and expansion. For the
Some of the embeddings are, in fact, optimum, in both dilation and expansion for small values of
[1] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, 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. 95101, 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. 415422,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. 151162, 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. 192204, 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, SpringerVerlag, Lecture Notes in Computer Science, vol 464, pp. 3046, 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. 3138, 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. 400406, 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. 755759, 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. 540547, 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. 1322, Jan. 1994.
[17] V.E. Mendia and D. Sarkar, “Optimal Broadcasting in the Star Graph,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 389396, July 1992.
[18] A. Menn and A.K. Somani, "An efficient sorting algorithm for the star graph," Proc. Int'l Conf. Parallel Processing, pp. 18, 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. 678687, 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. 1625, 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 4star graph is not a subgraph of any hypercube," Information Processing Letters, vol. 45, pp. 199203, 1993.
[26] S. Sur and P.K. Srimani, "A faulttolerant routing algorithm in star graphs," Proc. Int'l Conf. Parallel Processing, pp. 267270, 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.