Analysis and Design of a Half Hypercube Interconnection Network

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 240)

Abstract

This paper proposes a new half hypercube interconnection network that has the same number of nodes as a hypercube but reduces the degree by approximately half. To evaluate the effectiveness of the proposed half hypercube, its connectivity, routing, and diameter properties were analyzed. The analysis results demonstrate that the proposed half hypercube is an appropriate interconnection network for implementation in large-scale systems.

Keywords

Half hypercube Hypercube variation Interconnection network 

Notes

Acknowledgment

This research was supported by Basic Science research program through the National research Foundation of KOREA (NRF) funded by the Ministry of Education, Science and Technology (2012R1A1A4A01014439).

References

  1. 1.
    Leightoo FT (1992) Introduction to parallel algorithms and architectures: arrays, hypercubes. Morgan Kaufmann Publishers, San FranciscoGoogle Scholar
  2. 2.
    Mendia VE, Sarkar D (1992) Optimal broadcasting on the star graph. IEEE Trans Parallel Distrib Syst 3(4):389–396CrossRefMathSciNetGoogle Scholar
  3. 3.
    Sim H, Oh JC, Lee HO (2010) Multiple reduced hypercube (MRH): a new interconnection network reducing both diameter and edge of hypercube. Int J Grid Distrib Comput 3(1):19–30Google Scholar
  4. 4.
    Saad Y, Schultz MH (1988) Topological properties of hypercubes. IEEE Trans Comput 37(7):867–872CrossRefGoogle Scholar
  5. 5.
    Seitz CL (1985) The cosmic cube. Commun ACM 26:22–33CrossRefGoogle Scholar
  6. 6.
    Abraham S (1991) The twisted cube topology for multiprocessor: a study in network asymmetry. J Parallel Distrib Comput 13:104–110CrossRefGoogle Scholar
  7. 7.
    EI-Amawy A, Latifi S (1991) Properties and performance of folded hypercubes. IEEE Trans Parallel Distrib Syst 2(1):31–42Google Scholar
  8. 8.
    Ghose K, Desai KR (1995) Hierarchical cubic network. IEEE Trans Parallel Distrib Syst 6(4):427–435CrossRefGoogle Scholar
  9. 9.
    Kumar JM, Patnaik M (1992) Extended hypercube: a hierarchical interconnection network of hypercubes. IEEE Trans Parallel Distrib Syst 3(1):45–57CrossRefGoogle Scholar
  10. 10.
    Livingston M, Stout QF (1988) Embedding in hypercubes. Math Comput Model 11:222–227CrossRefMathSciNetGoogle Scholar
  11. 11.
    Akers SB, Harel D, Krishnamurthy B (1987) The star graph: an attractive alternative to the N-Cube. In: Proceedings of the international conference on parallel processing, pp 393–400Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht(Outside the USA) 2013

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of RochesterRochesterUSA
  2. 2.Department of Computer Science EducationCatholic University of DaeguDaeguSouth Korea
  3. 3.Department of Computer EducationSuncheon National UniversitySuncheonSouth Korea

Personalised recommendations