Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2008.15-A.6.345

Optimal Edge-Disjoint Spanning Trees in HyperStar Interconnection Network HS(2n,n)  

Kim, Jong-Seok (영남대학교 전자정보공학부)
Kim, Sung-Won (영남대학교 전자정보공학부)
Lee, Hyeong-Ok (순천대학교 컴퓨터교육과)
Publication Information
The KIPS Transactions:PartA / v.15A, no.6, 2008 , pp. 345-350 More about this Journal
Abstract
Recently, a HyperStar network HS(2n,n) has been introduced as a new interconnection network of new topology for parallel processing. HyperStar network 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 a construction algorithm of edge-disjoint spanning trees in HyperStar network HS(2n,n). Also, we prove that edge-disjoint spanning tree by the algorithm is optimal.
Keywords
Interconnection Network; HyperStar Interconnection Network; Optimal Edge-Disjoint Spanning Tree;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 S.L. Johnson and C.T. Ho, “Optimal broadcasting and personalized communication in hypercubes,” IEEE Trans. Computers, Vol.38, No.9, pp.1249-1268, 1989   DOI   ScienceOn
2 J.-S. Kim, E. Cheng, L. Liptak and H.-O. Lee, “Embedding hypercubes, rings and odd graphs into Hyper-stars,” International Journal of Computer Mathematics, 게재 예정   DOI   ScienceOn
3 C.-T. Lin, “Embedding k(n-k) edge-disjoint spanning trees in arrangement graphs,” J. Parallel and Distributed Computing, Vol.63, pp.1277-1287, 2003   DOI   ScienceOn
4 E. Cheng and L. Liptak, “Structural properties of hyper-stars,” Ars Combinatoria, Vol.80, pp.65-73, 2006
5 E. Cheng and M. Shah, “A strong structural theorem for hyper-stars,” Congressus Numerantium, Vol.179 pp.181-191, 2006
6 P. Fragopoulou and S.G. Akl, “Edge-disjoint spanning trees on the star network with applications to fault tolerance,” IEEE Trans. Computers, Vol.45, No.2, pp.174-185, 1996   DOI   ScienceOn
7 김종석, 이형옥, “상호연결망 HS(2n,n)의 이분할 에지수와 고장 지름 분석”, 정보처리학회논문지A, Vol.12-A, No.6, pp.499-506, 2005. 12   과학기술학회마을   DOI
8 P. Fraigniaud and C.T. Ho, “Arc-disjoint spanning trees on the cube connected cycles network,” Proc. International Conference on Parallel Processing, Vol.1, pp.225-229, 1991
9 W. Shi and P.K. Srimani, “One to all broadcast in hyper butterfly networks,” International Conference on High Performance Computing, pp.155-162, 1998   DOI
10 김종석, 오은숙, 이형옥, “하이퍼-스타 연결망의 위상적 망성질과 방송 알고리즘”, 정보처리학회논문지A, Vol.11-A, No.5, pp.341-346, 2004   과학기술학회마을
11 김종석, 이형옥, “PMC 모델과 비교진단모델을 이용한 하이퍼-스타 연결망의 진단도 분석”, 정보처리학회논문지A, Vol.13-A, No.1, pp.19-26, 2006. 2   과학기술학회마을   DOI
12 H.-O. Lee, J.-S. Kim, E. Oh, and 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   DOI   ScienceOn