Skip to main content
Log in

Embedding of the Folded Hypercubes into Tori

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

Abstract

One of the most popular variants of hypercube network is the folded hypercube which can be constructed by adding a link to every pair of nodes with complementary addresses. The folded hypercube has been shown to be able to improve the system’s performance over a regular hypercube in many measurements. The family of torus is also one of the most popular interconnection networks due to its desirable properties such as regular structure, ease of implementation and good scalability. This paper is on the embedding of folded hypercube network into a family of torus whose exact wirelength is computed using the Congestion lemma and Partition lemma.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bezrukov S.L.: Embedding complete trees into the hypercube. Discret. Appl. Math. 110(2-3), 101–119 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bezrukov, S.L., Chavez, J.D., Harper, L.H., Rottger, M., Schroeder, U.P.: Embedding of hypercubes into grids. MFCS, Electronic Edition Springer. Lecture Notes in Computer Science, vol. 1450, pp. 693–701 (1998)

  3. Bezrukov S.L., Das S.K., Elsässer R.: An edge-isoperimetric problem for powers of the Petersen graph. Ann. Comb. 4, 153–169 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bezrukov S.L., Monien B., Unger W., Wechsung G.: Embedding ladders and caterpillars into the hypercube. Discret. Appl. Math. 83, 21–29 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dvor̂ák T.: Dense sets and embedding binary trees into hypercubes. Discret. Appl. Math. 155(4), 506–514 (2007)

    Article  Google Scholar 

  6. EI-Amawy A., Latifi S.: Properties and performance of folded hypercubes. IEEE Trans. Parallel Distrib. Syst. 2(1), 31–42 (1991)

    Article  Google Scholar 

  7. Fang J.-F., Lai K.-C.: Embedding the incomplete hypercube in books. Inf. Sci. 96, 1–6 (2005)

    MATH  MathSciNet  Google Scholar 

  8. Firsov V.V.: On isometric embedding of a graph into a boolean cube. Cybernetics 1 1, 112–113 (1965)

    Article  Google Scholar 

  9. Garey M.R., Johnson D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  10. Gavrilova, M.L.: Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Comput. Sci. Appl. ICCSA (2006)

  11. Gupta A.K., Nelson D., Wang H.: Efficient embeddings of ternary trees into hypercubes. J. Parallel Distrib. Comput. 63(6), 619–629 (2003)

    Article  MATH  Google Scholar 

  12. Hayes J.P.: A graph model for fault-tolerant computing systems. IEEE Trans. Comput. C-25, 875–884 (1976)

    Article  Google Scholar 

  13. Heisen, S.Y.: Path embedding on folded hypercubes. In: Proceedings of the 4th International Conference on Theory and Applications of Models of Computation (2007)

  14. Hsu L.-H., Lin C.-K.: Graph Theory and Interconnection Networks. CRC Press, Boca Raton (2008)

    Google Scholar 

  15. Hsieh S.-Y.: 1-vertex-fault-tolerant cycles embedding on folded hypercubes. Discret. Appl. Math. 157, 3094–3098 (2009)

    Article  MATH  Google Scholar 

  16. Kautz W.H.: Unit distance error checking codes. IRE Trans. 7, 179–180 (1958)

    Article  Google Scholar 

  17. Klasing, R.: Methods and Problems of Wavelength Routing in All—Optical Networks, p. 348. University of Warwick Publications Service and WRAP (1998)

  18. Manuel P., Arockiaraj M., Rajasingh I., Rajan B.: Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discret. Appl. Math. 159(17), 2109–2116 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  19. Manuel P., Rajasingh I., Rajan B., Mercy H.: Exact wirelength of hypercube on a grid. Discret. Appl. Math. 157(7), 1486–1495 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  20. Opatrny J., Sotteau D.: Embeddings of complete binary trees into grids and extended grids with total vertex congestion 1. Discret. Appl. Math. 98, 237–254 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  21. Rajasingh I., Arockiaraj M.: Linear wirelength of folded hypercubes. Math. Comput. Sci. 5(1), 101–111 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  22. Rajasingh I., Rajan B., Rajan R.S.: On embedding of m-sequencial k-ary trees into hypercubes. Appl. Math. 1(6), 499–503 (2010)

    Article  Google Scholar 

  23. Rottger M., Schroeder U.P.: Efficient embeddings of grids into grids. Discret. Appl. Math. 108, 143–173 (2001)

    Article  MathSciNet  Google Scholar 

  24. Wang D.: Embedding Hamiltonian cycles into folded hypercube with faulty links. J. Parallel Distrib. Comput. 61(4), 545–564 (2001)

    Article  MATH  Google Scholar 

  25. Xu J.-M.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht (2001)

    Book  MATH  Google Scholar 

  26. Zhu Q., Xu J.M., Hou X., Xu M.: On reliability of the folded hypercubes. Inf. Sci. 177, 1782–1788 (2007)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sarah Surya Solomon.

Additional information

This work is supported by UGC, Project No.F. No. 39–47/2010.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Quadras, J., Solomon, S.S. Embedding of the Folded Hypercubes into Tori. Math.Comput.Sci. 9, 177–183 (2015). https://doi.org/10.1007/s11786-015-0223-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-015-0223-3

Keywords

Mathematics Subject Classification

Navigation