ÇѱÛÁ¦¸ñ(Korean Title) |
2^(2n-k)¡¿2k Åä·¯½º¿Í HFN(n,n), HCN(n,n) »çÀÌÀÇ ÀÓº£µù ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
Embedding Algorithm between 2^(2n-k)¡¿2k Torus and HFN(n,n), HCN(n,n) |
ÀúÀÚ(Author) |
±èÁ¾¼®
°¹Î½Ä
Jong-Seok Kim
Min-Sik Kang
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 14-A NO. 06 PP. 0327 ~ 0332 (2007. 12) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â 2^(2n-k¡¿2k) Åä·¯½º ¿¬°á¸Á°ú »óÈ£¿¬°á¸Á HFN(n,n)°ú HCN(n,n) »çÀÌÀÇ ÀÓº£µùÀ» ºÐ¼®ÇÑ´Ù. ¸ÕÀú, 2^(2n-k¡¿2k) Åä·¯½º¸¦ HFN(n,n)¿¡ ¿¬ÀåÀ² 3°ú ¹ÐÁýÀ² 4·Î ÀÓº£µù °¡´ÉÇÔÀ» º¸À̸ç, Æò±Õ¿¬ÀåÀ²ÀÌ 2 ÀÌÇÏÀÓÀ» Áõ¸íÇÑ´Ù. ±×¸®°í 2^(2n-k¡¿2k) Åä·¯½º¸¦ HCN(n,n)¿¡ ¿¬ÀåÀ² 3À¸·Î ÀÓº£µù °¡´ÉÇÔÀ» º¸À̸ç, Æò±Õ ¿¬ÀåÀ²ÀÌ 2 ÀÌÇÏÀÓÀ» Áõ¸íÇÑ´Ù. ¶ÇÇÑ HFN(n,n)°ú HCN(n,n)ÀÌ 2^(2n-k¡¿2k) Åä·¯½º¿¡ ÀÓº£µùÇÏ´Â ¿¬ÀåÀ²ÀÌ O(n)ÀÓÀ» º¸ÀδÙ. ÀÌ·¯ÇÑ °á°ú´Â Åä·¯½º¿¡¼ °³¹ßµÈ ¿©·¯ °¡Áö ¾Ë°í¸®ÁòÀ» HCN(n,n)°ú HFN(n,n)¿¡¼ È¿À²ÀûÀ¸·Î ÀÌ¿ëÇÒ ¼ö ÀÖÀ½À» ÀǹÌÇÑ´Ù.
|
¿µ¹®³»¿ë (English 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(n,n) 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).
|
Å°¿öµå(Keyword) |
Åä·¯½º
HFN(n,n)
HCN(n,n)
ÀÓº£µù
Torus
embedding
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|