
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Nader Bagherzadeh, Martin Dowd, Nayla Nassif, "Embedding an Arbitrary Binary Tree into the Star Graph," IEEE Transactions on Computers, vol. 45, no. 4, pp. 475481, April, 1996.  
BibTex  x  
@article{ 10.1109/12.494105, author = {Nader Bagherzadeh and Martin Dowd and Nayla Nassif}, title = {Embedding an Arbitrary Binary Tree into the Star Graph}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {4}, issn = {00189340}, year = {1996}, pages = {475481}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.494105}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Embedding an Arbitrary Binary Tree into the Star Graph IS  4 SN  00189340 SP475 EP481 EPD  475481 A1  Nader Bagherzadeh, A1  Martin Dowd, A1  Nayla Nassif, PY  1996 KW  Star graph KW  interconnection network KW  massively parallel KW  binary tree KW  embedding KW  load KW  dilation KW  tree partitioning. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—Binary tree structures have been very useful in solving divideandconquer 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
[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. 393400, 1987.
[2] S.B. Akers and B. Krishnamurthy,"A Group Theoretic Model for Symmetric Interconnection Networks," Proc. Int'l Conf. Parallel Processing, pp. 216223, 1986.
[3] M.A. Armstrong,Groups and Symmetry.New York: SpringerVerlag, 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. 319, 1994.
[5] N. Bagherzadeh,M. Dowd, and S. Latifi,"Faster Column Operations in Star Graphs," Tech. Rep. 940201, 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. 940203, 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,3981,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. 274282, 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. 151162, 1992.
[10] S.N. Bhatt and F.T. Leighton,"A Framework for Solving VLSI Graph Layout Problems," J. Computer System Science, vol. 28, pp. 300343, 1984.
[11] S.N. Bhatt and C.E. Leiserson,"How to Assemble Tree Machines," VLSI Theory: Advances in Computing Research, vol. 2, pp. 95114, 1984.
[12] P. Fragopoulou and S.G. Akl,"Optimal Communication Algorithms on Star Graphs Using Spanning Tree Construction," Tech. Rep. 93346, 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. 93106, 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. 1322, 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. 170180.Berlin, New York: SpringerVerlag, 1988.
[17] M. Nigam,S. Sahni, and B. Krishnamurthy,"Embedding Hamiltonians and Hypercubes in Star Interconnection Networks," Proc. Int'l Conf. Parallel Processing, pp. 340343, 1990.