The KIPS Transactions:PartA (정보처리학회논문지A)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

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

상호연결망 하이퍼-스타 HS(2n, n)의 이분할 에지수와 고장지름 분석

  • 김종석 (오클라호마 주립대학교 컴퓨터과학과) ;
  • 이형옥 (순천대학교 사범대학 컴퓨터교육과)
  • Published : 2005.12.01
Download PDF
⟨ Previous Next ⟩

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.

최근에 하이퍼큐브의 망비용을 개선한 하이퍼-스타 연결망 HS(m,k)이 제안되었다. 본 논문에서는 정규연결망 하이퍼-스타 HS(2n,n)의 이분할 에지수가 최대(2n-2,n-1)임을 보이고, 병렬경로 집합을 이용하여 k-광역지름이 dist(u, v)+4이하이고, HS(2n,n)의 고장지름이 D(HS(2n+n))+2 이하임을 보인다. dist(u,v)는 임의의 두 노드 u와 v 사이의 최단 거리를 나타내고, D(HS(2n,n))는 HS(2n,n)의 지름을 나타낸다.

Keywords

References

  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 https://doi.org/10.1109/71.824643
  2. D.Z. Du, D.F. Hsu, Y.D. Lyuu, 'On the diameter vulnerability of Kautz digraphs,' Discrete Math. Vol.151, pp.81-85, 1996 https://doi.org/10.1016/0012-365X(94)00084-V
  3. D.R. Duh, G.B. Chen, 'On the Rabin number problem,' Networks, Vol.30, pp.219-230, 1997 https://doi.org/10.1002/(SICI)1097-0037(199710)30:3<219::AID-NET6>3.0.CO;2-O
  4. 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 https://doi.org/10.1109/TPDS.2005.115
  5. 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 https://doi.org/10.1109/TC.2003.1197133
  6. M. S. Krishnamoorthy, B. Krishnamurthy, 'Fault diameter of interconnection networks,' Comput. Math. Apl., Vol.13, No.5-6, pp.577-582, 1987 https://doi.org/10.1016/0898-1221(87)90085-X
  7. 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
  8. F.T. Leighton, Introduction to Parallel Algorithms and Architectures : Arrays, Hypercubes, Morgan Kaufmann Publishers, 1992
  9. 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 https://doi.org/10.1007/BF01608486
  10. 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 https://doi.org/10.1109/71.149958
  11. 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 https://doi.org/10.1109/TPDS.2005.96
  12. K.W. Tang and S.A Padubidri, 'Diagonal and Toroidal Mesh Networks,' IEEE Trans. Computers, Vol.43, No.7, pp.815-826, 1994 https://doi.org/10.1109/12.293260
  13. 김종석, 오은숙, 이형옥, '하이퍼-스타 연결망의 위상적 망성질과 방송 알고리즘', 한국정보처리학회논문지, Vol.11-A, No.5, pp.341-346, 2004