Topological Properties and Broadcasting Algorithm of Hyper-Star Interconnection Network


The KIPS Transactions:PartA, Vol. 11, No. 5, pp. 341-346, Oct. 2004
10.3745/KIPSTA.2004.11.5.341,   PDF Download:

Abstract

Recently A Hyper-Star Graph HS(m,k) has been introduced as a new interconnection network of new topology for parallel processing. Hyper-Star Graph has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show that Hyper-Star Graph HS(m,k) is subgraph of hypercube. And we also show that regular graph, Hyper-Star Graph HS(2n,n) is node-symmetric by introduced mapping algorithm. In addition, we introduce an efficient one-to-all broadcasting scheme - takes 2n-1 times-in Hyper-Star Graph HS(2n,n) based on a spanning tree with minimum height.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. S. Kim, E. S. Oh, H. O. Lee, "Topological Properties and Broadcasting Algorithm of Hyper-Star Interconnection Network," The KIPS Transactions:PartA, vol. 11, no. 5, pp. 341-346, 2004. DOI: 10.3745/KIPSTA.2004.11.5.341.

[ACM Style]
Jong Seok Kim, Eun Seuk Oh, and Hyeong Ok Lee. 2004. Topological Properties and Broadcasting Algorithm of Hyper-Star Interconnection Network. The KIPS Transactions:PartA, 11, 5, (2004), 341-346. DOI: 10.3745/KIPSTA.2004.11.5.341.