Advertisement

Journal of Computer Science and Technology

, Volume 17, Issue 3, pp 356–361 | Cite as

Study of general incomplete star interconnection networks

  • Shi Yuntao Email author
  • Hou Zifeng 
  • Song Jianping 
Notes

Abstract

The star networks, which were originally proposed by Akers and Harel, have suffered from a rigorous restriction on the number of nodes. The general incomplete star networks (GISN) are proposed in this paper to relieve this restriction. An efficient labeling scheme for GISN is given, and routing and broadcasting algorithms are also presented for GISN. The communication diameter of GISN is shown to be bounded by 4n–7. The proposed single node broadcasting algorithm is optimal with respect to time complexityO(nlog2 n).

Keywords

interconnection network expandability incomplete star graph routing and broadcasting algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Akers S, Harel D, Krishnamurthy B. The star graph: An attractive alternative to then-cube. InProc. Int. Conf. Parallel Processing, 1987, pp.393–400.Google Scholar
  2. [2]
    Akers S, Krishnamurthy B. A group theoretic model for symmetric interconnection networks.IEEE Trans. Computers, Apr., 1989, 38(4): 555–566.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    Day K, Tripathi A. A comparative study of topological properties of hypercubes and star graphs.IEEE Trans. Parallel and Distributed Systems, Jan., 1994, 5(1): 31–38.CrossRefMathSciNetGoogle Scholar
  4. [4]
    Jwo J S, Larshmivararhan S, Dahall S K. Embeddings of cycles and grids in star graphs. InProc. Symp. Parallel and Distributed Processing, 1990, pp.540–547.Google Scholar
  5. [5]
    Mišic J, Jovanovic Z. Communication aspects of the star graph interconnection network.IEEE Trans. Parallel and Distributed Systems, July, 1994, 5(7): 678–687.CrossRefGoogle Scholar
  6. [6]
    Mendia V E, Sarkar D. Optimal broadcasting on the star graph.IEEE Trans. Parallel and Distributed Systems, Mar., 1992, 3(3): 389–396.CrossRefMathSciNetGoogle Scholar
  7. [7]
    Sheu J P, Wu C T, Chen T S. An optimal broadcasting algorith without message redundancy in the star graphsIEEE Trans. Parallel and Distributed Systems, June, 1995, 6(6): 653–658.CrossRefGoogle Scholar
  8. [8]
    Bagherzadeh N, Latifi S. A routing and broadcasting scheme on faulty star graphs.IEEE Trans. Computers, Nov., 1993, 42(11): 1398–1403.CrossRefGoogle Scholar
  9. [9]
    Latifi S, Bagherzadeh N. Incomplete star: An incrementally scalable network based on the star graph.IEEE Trans. Parallel and Distributed Systems, Jan., 1994, 5(1): 97–102.CrossRefGoogle Scholar
  10. [10]
    Ravikumar C P, Kuchlous A, Manimaran G. Incomplete star graph: An economical fault-tolerant interconnection network. InProc. Int. Conf. Parallel Processing, 1993, pp.83–90.Google Scholar
  11. [11]
    Su M Y, Chen G H, Duh D R. Broadcasting on incomplete WK-recursive networks.Journal of Parallel Distributed Computing, 1999, 57(2): 271–294.zbMATHCrossRefGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2002

Authors and Affiliations

  1. 1.Institute of Computing TechnologyThe Chinese Academy of SciencesBeijingP.R. China

Personalised recommendations