Embedding Algorithm between 22n-kx2k Torus and HFN(n,n), HCN(n,n)


The KIPS Transactions:PartA, Vol. 14, No. 6, pp. 327-332, Dec. 2007
10.3745/KIPSTA.2007.14.6.327,   PDF Download:

Abstract

In this paper, we will analysis embedding between 22n-k×2k torus and interconnection networks HFN(n,n), HCN(n,n). First, we will prove that 22n-k×2k torus can be embedded into HFN(n,n) with dilation 3, congestion 4 and the average dilation is less than 2. And we will show that 22n-k×2k torus can be embedded into HCN(n,n) with dilation 3 and the average dilation is less than 2. Also, we will prove that interconnection networks HFN(nn) and HCN(n,n) can be embedded into 22n-k×2k torus with dilation O(n). These results mean so many developed algorithms in torus can be used efficiently in HFN(n,n) and HCN(n,n).


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 and M. S. Kang, "Embedding Algorithm between 22n-kx2k Torus and HFN(n,n), HCN(n,n)," The KIPS Transactions:PartA, vol. 14, no. 6, pp. 327-332, 2007. DOI: 10.3745/KIPSTA.2007.14.6.327.

[ACM Style]
Jong Seok Kim and Min Sik Kang. 2007. Embedding Algorithm between 22n-kx2k Torus and HFN(n,n), HCN(n,n). The KIPS Transactions:PartA, 14, 6, (2007), 327-332. DOI: 10.3745/KIPSTA.2007.14.6.327.