Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Fault Diameter of Recursive Circulant $G(2^{m},2^{k})$

재귀원형군 $G(2^{m},2^{k})$의 고장 지름

  • 김희철 (한국외국어대학교 컴퓨터 및 정보통신공학부) ;
  • 정호영 (한국외국어대학교 컴퓨터공학과) ;
  • 박정흠 (가톨릭대학교 컴퓨터·전자공학부)
  • Published : 2002.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

The fault diameter of a graph G is the maximum of lengths of the shortest paths between all two vertices when there are $\chi$(G) - 1 or less faulty vertices, where $\chi$(G) is connectivity of G. In this paper, we analyze the fault diameter of recursive circulant $G(2^m,2^k)$ with $k{\geq}3$. Let $ dia_{m.k}$ denote the diameter of $G(2^m,2^k)$. We show that if $2{\leq}m,2{\leq}k, the fault diameter of $G(2{\leq}m,2{\leq}k)$ is equal to $2^m-2$, and if m=k+1, it is equal to $2^k-1$. It is also shown that for m>k+1, the fault diameter is equal to di a_$m{\neq}1$(mod 2k); otherwise, it is less than or equal to$dia_{m.k+2}$.

그래프 G의 고장지름이란 임의의 연결도-1 개 이하의 정점들에 고장이 났을 경우, 모든 두 정점사이의 최단경로 길이의 최대 값을 말한다. 본 논문에서는 $k{\geq}3$인 재귀원형군 $G(2{\leq}m,2{\leq}k)$의 고장 지름을 분석한다. $ dia_{m.k}$를$ G(2^m,2^k)$의 지름이라 하자. $G(2{\leq}m,2{\leq}k/)$일 때, $G(2{\leq}m,2{\leq}k)$의 고장지름은 $2^m-2이고$, m=k+1일 때, 고장지름은 $2^k-1$임을 보인다. 그리고 m>k+1인 재귀원형군 $G(2{\leq}m,2{\leq}k)$에서, m=1 (mod 2k)이면 고장지름은 $dia_{m.k+1}$과 같고, $m{\neq}1$ (mod 2k)이면 고장지름은 $dia_{m.k+2}$ 이하임을 보인다.

Keywords

References

  1. K. Day and A. E. Al-Ayyoub, 'Fault diameter of k-ary n-cube networks,' IEEE Trans. Parallel and Distributed Systems 8(9), pp. 903-907, 1997 https://doi.org/10.1109/71.615436
  2. M. S. Krishnamoorthy and B. Krishnamurthy, 'Fault diameter of interconnection networks,' Computing Mathematical Applications 13, pp. 577-582, 1987 https://doi.org/10.1016/0898-1221(87)90085-X
  3. S. Latifi, 'Combinatorial analysis of the fault-diameter of the n-cube,' IEEE Trans. Computers 42(1), pp. 27-33, 1993 https://doi.org/10.1109/12.192211
  4. Y. Rouskov and P. K. Srimani, 'Fault diameter of star graphs,' Information Processing Letters 48, pp. 243-251, 1993 https://doi.org/10.1016/0020-0190(93)90087-P
  5. J.-J. Sheu and L.-H. Hsu, 'Fault diameter for subcubes,' Parallel Processing Letters 9(1), pp. 21-30, 1999 https://doi.org/10.1142/S0129626499000050
  6. C.-P. Chang, J.-N. Wang, L.-H. Hsu, 'Topological properties of twisted cube,' Information Sciences 113, pp. 147-167, 1999 https://doi.org/10.1016/S0020-0255(98)10045-2
  7. J.-H. Park and K.-Y. Chwa, 'Recursive circulant: a new topology for multiprocessor networks,' in Proc. International Symposium on Parallel Architectures, Algorithms and Networks ISPAN'94, Kanazawa, Japan, pp. 73-80, 1994
  8. J.-H. Park and K.-Y. Chwa, 'Recursive circulants and their embeddings among hypercubes,' Theoretical Computer Science 244, pp. 35-62, 2000 https://doi.org/10.1016/S0304-3975(00)00176-6
  9. 김희철, 김상범, 좌경룡, '재귀원형군의 고장지름,' 한국정보과학회 가을 학술발표회 21(2), pp. 663-666, 1994
  10. 박정흠, 좌경룡, '재귀원형군의 위상 특성: 서로소인 경로,' 정보과학회논문지(A), 26(8), pp. 1009-1023, 1999