This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Embedding Complete Binary Trees Into Butterfly Networks
July 1991 (vol. 40 no. 7)
pp. 853-863

The authors present embeddings of complete binary trees into butterfly networks with or without wrap-around connections. Let m be an even integer and q=m+(log m)-1. The authors show how to embed a 2/sup q+1/-1-node complete binary tree T(q) into a (m+1)2/sup m+1/-node wrap-around butterfly B/sub w/(m+1) with a dilation of 4, and how to embed T(q) into a (m+2)2/sup m+2/-node wrap-around butterfly B/sub w/(m+2) with an optimal dilation of 2. They also present an embedding of a wrap-around butterfly B/sub w/(m) into a (m+1)2/sup m/-node no-wrap-around butterfly B(m) with a dilation of 3. Using this embedding it is shown that T(q) can be embedded into a no-wrap butterfly B(m+1) (resp. B(m+2)) with a dilation of 8 (resp. 5).

[1] R. Aleliunas and A. Rosenberg, "On embedding rectangular grids into square grids,"IEEE Trans. Comput., vol. C-31, pp. 907-913, 1982.
[2] M. J. Atallah, "On multidimensional arrays of processors,"IEEE Trans. Comput., vol. 37, pp. 1306-1309, Oct. 1988.
[3] S. Bettayeb, I. H. Sudborough, and Z. Miller, "Embedding grids into hypercubes," inProc. 3rd Aegean Workshop Comput., 1988.
[4] S. Bhatt, F. Chung, J.-W. Hong, F. T. Leighton, and A. L. Rosenberg, "Optimal simulations by Butterfly networks," inProc. 20th Symp. Theory Comput., May 1988, pp. 192-204.
[5] S. Bhatt, F. Chung, F. T. Leighton, and A. Rosenberg, "Optimal simulations of tree machines," inProc. 27th Symp. Foundations Comput. Sci., 1986, pp. 274-282.
[6] M. Y. Chan and F. Y. L. Chin, "On embedding rectangular grids in hypercubes,"IEEE Trans. Comput., vol. 37, pp. 1285-1288, Oct. 1988.
[7] J. P. Fishburn and R. A. Finkel, "Quotient networks,"IEEE Trans. Comput., vol. C-31, pp. 288-295, Apr. 1982.
[8] A. K. Gupta and S. E. Hambrusch, "Embedding large tree machines into small ones," inProc. 5th MIT Conf. Advanced Res. VLSI, Mar. 1988, pp. 179-199.
[9] J.-W. Hong, K. Mehlhorn, and A. Rosenberg, "Cost trade-offs in graph embeddings, with applications,"J. ACM, pp. 709-728, 1983.
[10] S.R. Kosaraju and M. Atallah, "Optimal simulations between mesh connected array of processors,"J. ACM, vol. 35, no. 3, pp. 635-650, July 1988.
[11] A.L. Rosenberg, "Preserving proximity in arrays,"SlAM J. Comput., pp. 443-460, 1979.
[12] Y. Saad and M.H. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. 37, pp. 867-872, July 1988.

Index Terms:
embeddings; complete binary trees; butterfly networks; wrap-around connections; multiprocessor interconnection networks; trees (mathematics).
Citation:
A.K. Gupta, S.E. Hambrusch, "Embedding Complete Binary Trees Into Butterfly Networks," IEEE Transactions on Computers, vol. 40, no. 7, pp. 853-863, July 1991, doi:10.1109/12.83623
Usage of this product signifies your acceptance of the Terms of Use.