Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2009.16A.6.501

Symmetry and Embedding Algorithm of Interconnection Networks Folded Hyper-Star FHS(2n,n)  

Kim, Jong-Seok (영남대학교 전자정보공학부)
Lee, Hyeong-Ok (순천대학교 컴퓨터교육과)
Kim, Sung-Won (영남대학교 전자정보공학부)
Publication Information
The KIPS Transactions:PartA / v.16A, no.6, 2009 , pp. 501-508 More about this Journal
Abstract
In this paper, we prove that folded hyper-star network FHS(2n,n) is node-symmetric and a bipartite network. We show that FHS(2n,n) can be embedded into odd network On+1 with dilation 2, congestion 1 and Od can be embedded into FHS(2n,n) with dilation 2 and congestion 1. Also, we show that $2n{\time}n$ torus can be embedded into FHS(2n,n) with dilation 2 and congestion 2.
Keywords
Folded Hyper-Star Network; Node Symmetry; Bipartite Network; Embedding;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 S. B. Akers, D. Harel, and B. Krishnamurthy, “The star graph: An attractive alternative to the n‐cube,” Proc. of the Int. Conf. Parallel Processing, pp.216-223, 1986
2 N. Biggs, “Some Odd Graph Theory,” Annals of New York Academy of Sciences, Vol.319, pp.71-81, 1979   DOI
3 E. Cheng and L. Liptak, “Structural properties of hyperstars,” Ars Combinatoria, Vol.80, pp.65-73, 2006
4 김종석, 이형옥, “PMC 모델과 비교진단모델을 이용한 하이퍼- 스타 연결망의 진단도 분석,” 정보처리학회논문지A, Vol.13-A, No.1, pp.19-26, 2006
5 김종석, “Folded 하이퍼-스타 FHS(2n,n)의 위상적 성질 분석,” 정보처리학회 논문지 A, Vol.14-A, No.5, pp.263-268, 2007
6 김종석, 오은숙, 이형옥, “하이퍼-스타 연결망의 위상적 망성질과 방송 알고리즘,” 정보처리학회논문지A, Vol.11-A, No.5, pp.341-346, 2004
7 Q. Dong, X. Yang, J. Zhao and Y.Y. Tang, “Embedding A Family of Disjoint 3D Meshes into A Crossed Cube,” Information Sciences, Vol.178, No.11, pp.2396-2405, 2008   DOI   ScienceOn
8 김종석, 이형옥, “상호연결망 HS(2n,n)의 이분할 에지수와 고 장 지름 분석,” 정보처리학회논문지A, Vol.12-A, No.6, pp.499-506, 2005
9 E. Cheng and M. Shah, “A strong structural theorem for hyper-stars,” Congressus Numerantium, Vol.179, pp.181-191, 2006
10 W. Dally and C. Seitz, “The Torus Routing Chip,” Distrib. Comput., Vol.1, pp.187-196, 1986   DOI   ScienceOn
11 J. Fan and X. Jia, “Embedding Meshes into Crossed Cubes,” Information Sciences, Vol.177, No.15, pp.3151-3160, 2007   DOI   ScienceOn
12 A. Ghafoor and T. R. Bashkow, “A Study of Odd Graphs as Fault-Tolerant Interconnection Networks,” IEEE Trans. Computers, Vol.40, No.2, pp.225-232, 1991   DOI   ScienceOn
13 J.-S. Kim, E. Cheng, L. Liptak, H.-O. Lee, “Embedding hypercubes, rings and odd graphs into Hyper-stars,” International Journal of Computer Mathematics, Vol.86, No.5, pp.771-778, 2009   DOI   ScienceOn
14 이형옥, 김병철, 임형석, “하이퍼-스타 그래프 : 다중 컴퓨터를 위한 새로운 상호 연결망,” 정보처리논문지, Vol.5, No.12, pp.3099-3108, 1998   과학기술학회마을
15 H.-O. Lee, J.-S. Kim, E. Oh, H.-S. Lim, “Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube,” Lecture Notes in Computer Science : EurAsia-ICT 2002, LNCS 2510, pp.858-865, 2002
16 W. Shi and P. K. Srimani, “Hierarchical star: a new two level interconnection network,” Journal of Systems Architecture, Vol.51, pp.1-14, 2005   DOI   ScienceOn
17 김숙연, “메쉬의 교차큐브에 대한 임베딩,” 정보처리학회논문지A, Vol.15-A, No.6, pp.301-308, 2008
18 이형옥, 최정, 박승배, 조정호, 임형석, “Folded 하이퍼-스타 그 래프의 병렬 경로,” 정보처리논문지, Vol.6, No.7, pp.1756-1769, 1999   과학기술학회마을