Skip to main content
SpringerLink
Log in

Embedding complete binary trees in product graphs

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

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 with small dilation and congestion. In the embedding results 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Efe, Embedding large complete binary trees in hypercubes with load balancing, Journal of Parallel and Distributed Computing 35(1) (1996) 104–109.

    Article  Google Scholar 

  2. K. Efe and A. Fernández, Products of networks with logarithmic diameter and fixed degree, IEEE Transactions on Parallel and Distributed Systems 6 (September 1995) 963–975.

  3. 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 (1996).

  4. R. Feldmann and W. Unger, The cube-connected cycles network is a subgraph of the butterfly network, Parallel Processing Letters 2(1) (1992) 13–19.

    Article  Google Scholar 

  5. A. Fernández, Homogeneous product networks for processor interconnection, Ph.D. thesis, University of Southwestern Louisiana, Lafayette, LA (1994).

    Google Scholar 

  6. J.P. Fishburn and R.A. Finkel, Quotient networks, IEEE Transactions on Computers 31 (April 1982) 288–295.

  7. R. Koch, T. Leighton, B. Maggs, S. Rao and A.L. Rosenberg, Work-preserving emulations of fixedconnection networks, in: Proc. of the 21st Annual ACM Symposium on Theory of Computing, Seattle (May 1989) pp. 227–240.

  8. A.L. Rosenberg, Product-shuffle networks: Toward reconciling shuffles and butterflies, Discrete Applied Mathematics 37/38 (July 1992) 465–488.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Bilkent University, Ankara, 06533, Turkey

    Kemal Efe

  2. Computer Science Department, University of Southwestern Louisiana, Lafayette, LA, 70504, USA

    Adrienne L. Broadwater

  3. Dipartimento de Arquitectura y Tecnogia de Computadores, Escuela Universitaria de Informatica, Ctra. Valencia Km. 7, 28031, Madrid, Spain

    Antonio Fernandez

Authors
  1. Kemal Efe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adrienne L. Broadwater
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio Fernandez
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Efe, K., Broadwater, A.L. & Fernandez, A. Embedding complete binary trees in product graphs. Telecommunication Systems 13, 99–109 (2000). https://doi.org/10.1023/A:1019179619964

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019179619964

Keywords

Search

Navigation