Study of general incomplete star interconnection networks
- 21 Downloads
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).
Keywordsinterconnection network expandability incomplete star graph routing and broadcasting algorithm
Unable to display preview. Download preview PDF.
- 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
- 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
- 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