Advertisement

Topological and Communication Aspects of Hyper-Star Graphs

  • Jong-Seok Kim
  • Eunseuk Oh
  • Hyeong-Ok Lee
  • Yeong-Nam Heo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2869)

Abstract

A hyper-star graph HS(m,k) has been introduced as a class of lower cost interconnection networks. Hyper-star graph has more merit than hypercube when degree × diameter is used as a cost measure. In other words, they have smaller degree and diameter than hypercubes. In this paper, we consider some of the important properties of hyper-star graphs such as symmetry, w-diameter, and fault diameter. We show that HS(2n,n) is node-symmetric. We also show that the w-diameter of HS(2n,n) is bounded by the shortest path length plus 4, and fault diameter of HS(2n,n) is bounded by its diameter plus 2. In addition, we introduce an efficient broadcasting scheme in hyper-star graphs based on a spanning tree with minimum height.

Keywords

Short Path Span Tree Source Node Cayley Graph Interconnection Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chang, C.-P., Sung, T.-Y., Hsu, L.-H.: Edge Congestion and Topological Properties of Crossed Cubes. IEEE Trans. Parallel and Distributed Systems 11(1), 64–80 (2000)CrossRefGoogle Scholar
  2. 2.
    Efe, K.: A Variation on the Hypercube with Lower Diameter. IEEE Trans. Computers 40(11), 1312–1316 (1991)CrossRefGoogle Scholar
  3. 3.
    Hsu, D.F.: On Container Width and Length in Graphs, Groups, and Networks. IEICE Trans. Fundamentals E77-A, 668–680 (1994)Google Scholar
  4. 4.
    Johnsson, S.L.: Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures. J. Parallel Distrib. Comput. 4, 133–172 (1987)CrossRefGoogle Scholar
  5. 5.
    Latifi, S.: Combinatorial Analysis of the Fault-Diameter of the n-cube. IEEE Trans. Computers 42(1), 27–33 (1993)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Lai, C.-N., Chen, G.-H., Duh, D.-R.: Constructing One-to-Many Disjoint Paths in Folded Hypercubes. IEEE Trans. Computers 51(1), 33–34 (2002)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Lee, H.-O., Kim, J.-S., Oh, E., Lim, H.-S.: Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of Hypercube. In: Shafazand, H., Tjoa, A.M. (eds.) EurAsia-ICT 2002. LNCS, vol. 2510, pp. 858–865. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Parhami, B., Kwai, D.-M.: Unified Formulation of Honeycomb and Diamond Networks. IEEE Trans. Parallel and Distributed Systems 12(1), 74–80 (2001)CrossRefGoogle Scholar
  9. 9.
    Yun, S.-K., Park, K.-H.: Comments on Hierarchical Cubic Networks. IEEE Trans. Parallel and Distributed Systems 9(4), 410–414 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Jong-Seok Kim
    • 1
  • Eunseuk Oh
    • 2
  • Hyeong-Ok Lee
    • 3
  • Yeong-Nam Heo
    • 1
  1. 1.Department of Computer ScienceSunchon National UniversitySunchon, ChonnamKOREA
  2. 2.Department of Computer ScienceTexas A&M UniversityCollege StationUSA
  3. 3.Department of Computer EducationSunchon National UniversityChonnamKOREA

Personalised recommendations