This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Embedding an Arbitrary Binary Tree into the Star Graph
April 1996 (vol. 45 no. 4)
pp. 475-481

Abstract—Binary tree structures have been very useful in solving divide-and-conquer type of problems. Embedding binary trees into another network—the host network—helps in designing solutions for the host network using the known solutions on binary trees. Embedding arbitrary binary trees into networks, in particular into the hypercube, has been addressed in the literature. The latter was achieved with load 1 and constant dilation.

The n-star graph is a recently introduced interconnection network for massively parallel systems. It enjoys symmetry and fault tolerance properties that make it a viable alternative to the hypercube. In this paper, we address the problem of embedding arbitrary binary trees into the n-star graph. This work is the first to present such an embedding. The tree has $\lfloor e(n - 1)!\rfloor$ or fewer vertices. The embedding leads to load 1 and constant dilation for all values of n. It therefore enables the star graph to efficiently simulate an arbitrary binary tree with only a constant factor of communication delay.

[1] S.B. Akers,D. Harel, and B. Krishnamurthy,"The Star Graph: An Attractive Alternative to the n−Cube," Proc. Int'l Conf. Parallel Processing, pp. 393-400, 1987.
[2] S.B. Akers and B. Krishnamurthy,"A Group Theoretic Model for Symmetric Interconnection Networks," Proc. Int'l Conf. Parallel Processing, pp. 216-223, 1986.
[3] M.A. Armstrong,Groups and Symmetry.New York: Springer-Verlag, 1988.
[4] M. Moraes de Azevedo,S. Latifi, and N. Bagherzadeh,"On Packing and Embedding Hypercubes into Star Graphs," Proc. Sixth Brazilian Symp. Computer Architecture and High Performance Computing, pp. 3-19, 1994.
[5] N. Bagherzadeh,M. Dowd, and S. Latifi,"Faster Column Operations in Star Graphs," Tech. Rep. 94-02-01, Electrical and Computer Eng. Dept., Univ. of California, Irvine, 1994.
[6] N. Bagherzadeh,M. Dowd, and N. Nassif,"Embedding an Arbitrary Binary Tree into the Star Graph," Tech. Rep. 94-02-03, Electrical and Computer Eng. Dept., Univ. of California, Irvine, 1994.
[7] N. Bagherzadeh, N. Nassif, and S. Latifi, “A Routing and Broadcasting Scheme on Faulty Star Graphs,” IEEE Trans. Computers, vol. 42, no. 11, pp. 1,398-1,403, Nov. 1993.
[8] S.N. Bhatt,F.R.K. Chung,F.T. Leighton, and A.L. Rosenberg,"Optimal Simulations of Tree Machines," IEEE Foundations of Computer Science, vol. 27, pp. 274-282, 1986.
[9] 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.
[10] S.N. Bhatt and F.T. Leighton,"A Framework for Solving VLSI Graph Layout Problems," J. Computer System Science, vol. 28, pp. 300-343, 1984.
[11] S.N. Bhatt and C.E. Leiserson,"How to Assemble Tree Machines," VLSI Theory: Advances in Computing Research, vol. 2, pp. 95-114, 1984.
[12] P. Fragopoulou and S.G. Akl,"Optimal Communication Algorithms on Star Graphs Using Spanning Tree Construction," Tech. Rep. 93-346, Dept. of Computing and Information Science, Queen's Univ. at Kingston, 1993.
[13] C.H. Goldberg and D.B. West,"Bisection of Circle Colorings," SIAM J. Alg. Disc. Meth., vol. 6, no. 1, pp. 93-106, 1985.
[14] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[15] 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.
[16] B. Monien and I.H. Sudborough,"Simulating Binary Trees on Hypercubes," VLSI Algorithms and Architectures: Lecture Notes in Computer Science; 319, pp. 170-180.Berlin, New York: Springer-Verlag, 1988.
[17] M. Nigam,S. Sahni, and B. Krishnamurthy,"Embedding Hamiltonians and Hypercubes in Star Interconnection Networks," Proc. Int'l Conf. Parallel Processing, pp. 340-343, 1990.

Index Terms:
Star graph, interconnection network, massively parallel, binary tree, embedding, load, dilation, tree partitioning.
Citation:
Nader Bagherzadeh, Martin Dowd, Nayla Nassif, "Embedding an Arbitrary Binary Tree into the Star Graph," IEEE Transactions on Computers, vol. 45, no. 4, pp. 475-481, April 1996, doi:10.1109/12.494105
Usage of this product signifies your acceptance of the Terms of Use.