Embeddings of tree-related networks in incomplete hypercubes

  • Sabine Öhring
  • Sajal K. Das
Paper Sessions Interconnection Networks: Embeddings
Part of the Lecture Notes in Computer Science book series (LNCS, volume 694)


An incomplete hypercube is a generalization of the well known hypercube network such that its number of nodes can be arbitrary as opposed to a strict power of two. The capability of the incomplete hypercubes to execute parallel programs using graph embedding techniques is studied in this paper. We present optimal (or near optimal) embeddings of various tree-related structures such as tree machines, mesh of trees, pyramids, and shuffle-trees into the optimum-sized incomplete hypercubes.


Interconnection networks graph embeddings incomplete hypercubes shuffle-trees pyramids mesh of trees 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ARS92]
    V. Auletta et al., On the fault tolerance and computational capabilities of the supercube. In Proc. 4th Italian Conf. on Theoretical Computer Science, pp. 38–52, 1992.Google Scholar
  2. [BGS92]
    A.J. Boals, A.K. Gupta, and N. A. Sherwani. Incomplete hypercubes: Embeddings and algorithms. manuscript, September 1992.Google Scholar
  3. [BI85]
    S.N. Bhatt and I. Ipsen. How to embed trees in hypercubes, Technical Report 443. Dept. of Computer Science, Yale Univ., New Heaven, CT, 1985.Google Scholar
  4. [BP89]
    J.C. Bermond and C. Peyrat. de bruijn and kautz networks: a competitor for the hypercube ? In Hypercubes and Distributed Computers, pp. 279–293, North-Holland, 1989.Google Scholar
  5. [CS86]
    T.F. Chan and Y. Saad. Multigrid algorithms on the hypercube multiprocessor. IEEE Trans. on Computers, vol. C-35, No. 11, pp. 969–977, November 1986.Google Scholar
  6. [DB92]
    S.K. Das and A.K. Banerjee. Hyper petersen network: Yet another hypercube-like topology. In Proceedings of the 4th Symposium on the Frontiers of Massively Parallel Computation (Frontiers ' 92), pp. 270–277, McLean, Virginia, USA, October 1992.Google Scholar
  7. [DGD92]
    S.K. Das, J. Ghosh, and N. Deo. Stirling networks: A versatile combinatorial topology for multiprocessor systems. Discrete Applied Mathematics, 37/38, special double volume on interconnection networks, pp. 119–146, July 1992.Google Scholar
  8. [DM93]
    S.K. Das and Aisheng Mao. Embeddings in recursive combinatorial networks. In Lecture Notes in Computer Science, vol. 657, pp. 184–204, 1993.Google Scholar
  9. [DÖ92]
    S.K. Das and S. Öhring. Embeddings of tree-related topologies in hyper petersen networks. Technical Report CRPDC-92-16, University of North Texas, University of Wuerzburg, September 1992.Google Scholar
  10. [Efe9l]
    K. Efe. Embedding mesh of trees in the hypercube. Journal of Parallel and Distributed Computing, 11:222–230, 1991.Google Scholar
  11. [GP91]
    E. Ganesan and D.K. Pradhan. The hyper-de bruijn multiprocessor networks. In Proceedings of the 11th Conference on Distributed Computing Systems, pp. 492–499, Arlington, TX, May 1991.Google Scholar
  12. [HJ87]
    C.T. Ho and S.L. Johnsson. On the embedding of arbitrary meshes in boolean cubes with expansion two dilation two. In Proc. 1987 Int. Conf. Parallel Processing, 1987.Google Scholar
  13. [Ho90]
    C.-T. Ho. Optimal Communication Primitives and Graph Embeddings on Hypercubes. PhD thesis, Yale university, May 1990.Google Scholar
  14. [Kat88]
    H. P. Katseff. Incomplete hypercubes. IEEE Trans. on Computers, vol. 37, no. 5, pp. 604–608, May 1988.Google Scholar
  15. [Lei92]
    F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays — Trees — Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992.Google Scholar
  16. [MS90]
    B. Monien and H. Sudborough. Embedding one interconnection network in another. In Computational Graph Theory, pages 257–282, Wien, 1990. Springer Verlag.Google Scholar
  17. [ÖD92a]
    S. Öhring and S.K. Das. On Dynamic and Modular Embeddings into Hyper de Bruijn Networks. Tech. Rep. TR 49, Univ. of Würzburg, Nov. 1992.Google Scholar
  18. [ÖD92b]
    S. Öhring and S.K. Das. Embeddings of tree-related networks in incomplete hypercubes. Technical Report CRPDC-92-20, University of North Texas, University of Wuerzburg, December 1992.Google Scholar
  19. [ÖD93]
    S. Öhring and S.K. Das. Dynamic embeddings of trees and quasi-grids into hyperde bruijn networks, to appear in the Proceedings of the 7th International Parallel Processing Symposium, Newport Beach, California, April 1993.Google Scholar
  20. [Sen89]
    A. Sen. Supercube: An optimally fault tolerant network architecture. Acta Informatica, 26:741–748, 1989.Google Scholar
  21. [SS88]
    Y. Saad and M.H. Schultz. Topological properties of hypercubes. IEEE Trans. on Computers, vol. 37, no. 7, pp. 867–872, 1988.Google Scholar
  22. [Sto86]
    Quentin F. Stout. Hypercubes and pyramids. In V. Cantoni and S. Levialdi, editors, Pyramidal Systems for Computer Vision, pp. 75–89. Springer, Heidelberg, 1986.Google Scholar
  23. [TCC90]
    N.F. Tzeng, H.-L. Chen, and P.-J. Chuang. Embeddings in incomplete hypercubes. In Proc. of the 1990 Int. Conf. on Parallel Processing, Vol. III, pp. 335–339, 1990.Google Scholar
  24. [TY91]
    J.-Y. Tien and W-P. Yang. Hierarchical spanning trees and distributing on incomplete hypercubes. Parallel Computing, 17:1343–1360, 1991.MathSciNetGoogle Scholar
  25. [Wu85]
    A.Y. Wu. Embedding of tree networks into hypercubes. Journal of Parallel and Distributed Computing, 2:238–249, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Sabine Öhring
    • 1
  • Sajal K. Das
    • 2
  1. 1.Department of Computer ScienceUniv. of WürzburgWürzburgGermany
  2. 2.Department of Computer ScienceUniv. of North TexasDentonUSA

Personalised recommendations