Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2005.12A.6.499

Analysis of Bisection width and Fault Diameter for Hyper-Star Network HS(2n, n)  

Kim, Jong-Seok (오클라호마 주립대학교 컴퓨터과학과)
Lee, Hyeong-Ok (순천대학교 사범대학 컴퓨터교육과)
Publication Information
The KIPS Transactions:PartA / v.12A, no.6, 2005 , pp. 499-506 More about this Journal
Abstract
Recently, Hyper-Star network HS(m,k) which improves the network cost of hypercube has been proposed. In this paper, we show that the bisection width of regular Hyper-Star network HS(2n,n) is maximum (2n-2,n-1). Using the concept of container, we also show that k-wide diameter of HS(2n,n) is less than dist(u,v)+4, and the fault diameter is less than D(HS(2n,n))+2, where dist(u,v) is the shortest path length between any two nodes u and v in HS(2n,n), and D(HS(2n,n)) is its diameter.
Keywords
Interconnection Network; Hyper-star; Fault Diameter; Bisection Width;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C.-P. Chang, T.-y. Sung, and L.-H. HSu, 'Edge Congestion and Topological Properties of Crossed Cubes,' IEEE Trans. Parallel and Distributed Systems, Vol.11, No.1, pp.64-80, 2000   DOI   ScienceOn
2 V.E. Mendia and D. Sarkar, 'Optimal Broadcasting on the Star Graph,' IEEE Trans. Parallel Distributed syst., Vol.3, No.4, pp.389-396, 1992   DOI   ScienceOn
3 B. Parhami, and M. Rakov, 'Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems,' IEEE Trans. Parallel and Distributed Systems, Vol.16, No.8, pp.714-724, 2005   DOI   ScienceOn
4 K.W. Tang and S.A Padubidri, 'Diagonal and Toroidal Mesh Networks,' IEEE Trans. Computers, Vol.43, No.7, pp.815-826, 1994   DOI   ScienceOn
5 김종석, 오은숙, 이형옥, '하이퍼-스타 연결망의 위상적 망성질과 방송 알고리즘', 한국정보처리학회논문지, Vol.11-A, No.5, pp.341-346, 2004
6 P. K Jha, 'A Counterexample to Tang and Padubidri's Claim about the bisection width of a Diagonal Mesh,' IEEE Trans. Computers, Vol.52, No.5, pp.676-677, 2003   DOI   ScienceOn
7 M. S. Krishnamoorthy, B. Krishnamurthy, 'Fault diameter of interconnection networks,' Comput. Math. Apl., Vol.13, No.5-6, pp.577-582, 1987   DOI   ScienceOn
8 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-lCT 2002, LNCS 2510, pp.858-865, 2002
9 F.T. Leighton, Introduction to Parallel Algorithms and Architectures : Arrays, Hypercubes, Morgan Kaufmann Publishers, 1992
10 S.C. Liaw, G.J. Chang, F. Cao, D.F. Hsu, 'Fault-tolerant routing in circulant networks and cycle prefix networks,' Ann. Comb., Vol.2, No.5-6, pp.165-172, 1998   DOI
11 D.R. Duh, G.B. Chen, 'On the Rabin number problem,' Networks, Vol.30, pp.219-230, 1997   DOI   ScienceOn
12 H. Hu, N. Gu, and J. Cao, 'A Note on Recursive Cube of Rings Network,' IEEE Trans. Parallel and Distributed Systems, Vol.16, No.10, pp.1007-1008, 2005   DOI   ScienceOn
13 D.Z. Du, D.F. Hsu, Y.D. Lyuu, 'On the diameter vulnerability of Kautz digraphs,' Discrete Math. Vol.151, pp.81-85, 1996   DOI   ScienceOn