Embedding Algorithms of Hierarchical Folded HyperStar Network


The KIPS Transactions:PartA, Vol. 16, No. 4, pp. 299-306, Aug. 2009
10.3745/KIPSTA.2009.16.4.299,   PDF Download:

Abstract

Hierarchical Folded HyperStar Network has lower network cost than HCN(n,n) and HFN(n,n) which are hierarchical networks with the same number of nodes. In this paper, we analyze embedding between Hierarchical Folded HyperStar HFH(Cn,Cn) and Hypercube, HCN(n,n), HFN(n,n). The results of embedding are that HCN(n,n), HFN(n,n) and Hypercube Q2n can be embedded into HFH(Cn,Cn) with expansion Cn²/2²ⁿ and dilation 2, 3, and 4, respectively. Also, HFH(Cn,Cn) can be embedded into HFN(2n,2n) with dilation 1. These results mean so many developed algorithms in Hypercube, HCN(n,n), HFN(n,n) can be used efficiently in HFH(Cn,Cn).


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, H. O. Lee, S. W. Kim, "Embedding Algorithms of Hierarchical Folded HyperStar Network," The KIPS Transactions:PartA, vol. 16, no. 4, pp. 299-306, 2009. DOI: 10.3745/KIPSTA.2009.16.4.299.

[ACM Style]
Jong Seok Kim, Hyeong Ok Lee, and Sung Won Kim. 2009. Embedding Algorithms of Hierarchical Folded HyperStar Network. The KIPS Transactions:PartA, 16, 4, (2009), 299-306. DOI: 10.3745/KIPSTA.2009.16.4.299.