Embedding complete binary trees in product graphs

  • Adrienne Broadwater
  • Kemal Efe
  • Antonio Fernández
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1197)


This paper shows how to embed complete binary trees in products of complete binary trees, products of shuffle-exchange graphs, and products of de Bruijn graphs. The main emphasis of the embedding methods presented here is how to emulate arbitrarily large complete binary trees in these product graphs with low slowdown. For the embedding methods presented here the size of the host graph can be fixed to an arbitrary size, while we define no bound on the size of the guest graph. This is motivated by the fact that the host architecture has a fixed number of processors due to its physical design, while the guest graph can grow arbitrarily large depending on the application. The results of this paper widen the class of computations that can be performed on these product graphs which are often cited as being low-cost alternatives for hypercubes.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K. Efe, “Embedding Large Complete Binary Trees in Hypercubes with Load Balancing,” Journal of Parallel and Distributed Computing, vol. 35, no. 1, May 1996, pp. 104–109.Google Scholar
  2. 2.
    K. Efe and A. Fernández, “Mesh Connected Trees: A Bridge between Grids and Meshes of Trees,” IEEE Transactions on Parallel and Distributed Systems. To appear in 1996.Google Scholar
  3. 3.
    K. Efe and A. Fernández, “Products of Networks with Logarithmic Diameter and Fixed Degree,” IEEE Transactions on Parallel and Distributed Systems, vol. 6, pp. 963–975, Sept. 1995.Google Scholar
  4. 4.
    R. Feldmann and W. Unger, “The Cube-Connected Cycles Network is a Subgraph of the Butterfly Network,” Parallel Processing Letters, vol. 2, no. 1, pp. 13–19, 1992.Google Scholar
  5. 5.
    A. Fernández, Homogeneous Product Networks for Processor Interconnection. PhD thesis, U. of Southwestern Louisiana, Lafayette, LA, Oct. 1994.Google Scholar
  6. 6.
    J. P. Fishburn and R. A. Finkel, “Quotient Networks,” IEEE Transactions on Computers, vol. 31, pp. 288–295, Apr. 1982.Google Scholar
  7. 7.
    R. Koch, T. Leighton, B. Maggs, S. Rao, and A. L. Rosenberg, “Work-Preserving Emulations of Fixed-Connection Networks,” in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, (Seattle), pp. 227–240, May 1989.Google Scholar
  8. 8.
    A. L. Rosenberg, “Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies,” Discrete Applied Mathematics, vol. 37/38, pp. 465–488, July 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Adrienne Broadwater
    • 1
  • Kemal Efe
    • 1
  • Antonio Fernández
    • 2
  1. 1.Center for Advanced Computer StudiesUniversity of Southwestern LouisianaLafayette
  2. 2.MIT Laboratory for Computer ScienceCambridge

Personalised recommendations