Skip to main content
SpringerLink
Log in

Study of general incomplete star interconnection networks

  • Notes
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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).

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

  2. Akers S, Krishnamurthy B. A group theoretic model for symmetric interconnection networks.IEEE Trans. Computers, Apr., 1989, 38(4): 555–566.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  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.

  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.

    Article  Google Scholar 

  6. Mendia V E, Sarkar D. Optimal broadcasting on the star graph.IEEE Trans. Parallel and Distributed Systems, Mar., 1992, 3(3): 389–396.

    Article  MathSciNet  Google Scholar 

  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.

    Article  Google Scholar 

  8. Bagherzadeh N, Latifi S. A routing and broadcasting scheme on faulty star graphs.IEEE Trans. Computers, Nov., 1993, 42(11): 1398–1403.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  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.

  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.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Technology, The Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Shi Yuntao, Hou Zifeng & Song Jianping

Authors
  1. Shi Yuntao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hou Zifeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Song Jianping
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shi Yuntao.

Additional information

The work of this paper is supported by the National Natural Science Foundation of China under Grant No.698962505.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shi, Y., Hou, Z. & Song, J. Study of general incomplete star interconnection networks. J. of Comput. Sci. & Technol. 17, 356–361 (2002). https://doi.org/10.1007/BF02947314

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02947314

Keywords

Search

Navigation