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).
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Akers S, Harel D, Krishnamurthy B. The star graph: An attractive alternative to then-cube. InProc. Int. Conf. Parallel Processing, 1987, pp.393–400.
Akers S, Krishnamurthy B. A group theoretic model for symmetric interconnection networks.IEEE Trans. Computers, Apr., 1989, 38(4): 555–566.
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.
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.
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.
Mendia V E, Sarkar D. Optimal broadcasting on the star graph.IEEE Trans. Parallel and Distributed Systems, Mar., 1992, 3(3): 389–396.
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.
Bagherzadeh N, Latifi S. A routing and broadcasting scheme on faulty star graphs.IEEE Trans. Computers, Nov., 1993, 42(11): 1398–1403.
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.
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.
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.
Author information
Authors and Affiliations
Corresponding author
Additional information
The work of this paper is supported by the National Natural Science Foundation of China under Grant No.698962505.
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02947314