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

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

Ring Embedding in (n.K) Star Graphs with Faulty Nodes

결함 노드를 갖는 (n,K)-스타 그래프에서의 링 임베딩

  • 장정환 (부산외국어대학교 컴퓨터전자공학부) ;
  • 김진수 (건국대학교 컴퓨터응용과학부)
  • Published : 2002.02.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we consider ring embeding problem in faulty (n,k) star graphs which is recently proposed as an alternative interconnection network topology, By effectively utilizing such strategies as series of dimension expansions and even distribution of faulty nodes into sub-stars in graph itself. we prove that it is possible to construct a maximal fault-free ring excluding only faulty nodes when the number of faults is no more than n-3 and $n-k{\geq}2$, and also propose an algorithm which can embed the corresponding ring in (n.k)-star graphs This results will be applied into the multicasting applications that the underlying cycle properties on the multi-computer system.

본 논문에서는 최근에 제안된 (n,K)-스타 그래프에서 결함 노드를 포함하는 경우의 링 임베딩 문제를 다룬다. 그래프 자체의 계층적 특성을 이용한 일련의 차원 확장 및 결함 노드의 분산 전략 을 효율적으로 이용하여 n-3개의 이하의 결함 노드만을 포함하고, $n-k{\geq}2$를 만족한는(n.k)-스타 그래프에서 고장 노드들만 제외시킨 최대 크기의 링을 임베딩할 수 있음을 보이고해당 임베딩 알고리즘을 제시한다. 본 논문에서 다루고 있는 사이클 특성과 관련된 림 임베딩 연구는 병렬 처리 분야에서의 멀티캐스팅 등 과 같이 내재된 사이클 특성을 활용하는 분야에 응용이 가능하다.

Keywords

References

  1. F. Berman and L. Snyder, 'On mapping parallel algorithms into parallel architectures,' J. of Parallel and Distrib. Comput, Vol.4, pp.439-458, 1987 https://doi.org/10.1016/0743-7315(87)90018-9
  2. B. Monien and H. Sudborough, 'Embedding one interconnection network in another,' Computing Supplement, Vol.7, pp.257-282, 1990 https://doi.org/10.1007/978-3-7091-9076-0_13
  3. Y. Saad and M. H. Scbultz, 'Topological properties of hypercubes,' IEEE Trans. on Comput, Vol.37, pp.867-872, 1988 https://doi.org/10.1109/12.2234
  4. S. B. Akers, D. Harel, and B. Krishnamurthy, 'The star graph: An attractive alternative to the n-cube,' Proc. of the Int'l Conf. on Parallel Processing, pp.393-400, 1987
  5. K. Day and A. Tripathi, 'A comparative study of topological properties of hypercubes and star graphs,' IEEE Trans, on Paral and Distrib. Sys., Vol.5, No.l, pp.31-38, 1994 https://doi.org/10.1109/71.262586
  6. W. K. Chiang and R. J. Chen, 'The (n,k)-star graph: A generalized star graph,' Inf. Process. Lett., Vol.56, pp.259-264, 1995 https://doi.org/10.1016/0020-0190(95)00162-1
  7. J. S. Jwo, S. Lakshmivarahan, and S. K. Dhall, 'Embedding of cycles and grids in star graphs,' Proc. of the Symp. on Parallel and Distrib. Processing, pp.540-547, 1990 https://doi.org/10.1109/SPDP.1990.143600
  8. M. Nigam, S. Sahni, and B. Krishnamurthy, 'Embedding hamiltonians and hypercubes in star interconnection graphs,' Proc. of the Int'l Conf. on Parallel Processing, pp.340-343, 1990
  9. Y. -C. Tseng, S. -H. Chang, and J. -P. Sheu, 'Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures,' IEEE Trans. on Paral, and Distrib. Sys., Vol. 8, No. 12, pp.1185-1195, 1997 https://doi.org/10.1109/71.640010
  10. J. -H. Chang, C. -S. Shin, and K. -Y. Chwa, 'Ring Embedding in Faulty Star Graphs,' IEICE Trans. on Fundamentals., Vol.E82-A, No.9, pp.1953-1964, 1999
  11. A. Bouabdallah, M. C. Heydemann, and J. Opatrny, 'Embedding complete binary trees into star networks,' Proc. of the Int'l Conf. on Mathematical Foundation of Computer Sci., pp. 266-275, 1994
  12. S. Ranka, J. C. Wang, and N. Yeh, 'Embedding meshes on the star graph,' J. of Parallel and Distrib. Comput, Vol.19, pp.131-135, 1993 https://doi.org/10.1006/jpdc.1993.1098
  13. W. K. Chiang and R. J. Chen, 'Topological properties of the (n,k)-star graph,' accepted and to appear in Int'l J. of Foundations of Computer Sci.
  14. 박천웅, 장직현, '(n-k)-스타 그래프상의 헤밀토니안 임베딩,' 한국정보과학회 논문지(A), Vol.25, No.12, pp.1384-1391, 1998
  15. 장정환, 좌경룡, '(n,k)-스타 그래프에서의 새로운 링 임베딩 결함 허용 임베딩으로의 응용,' 한국정보과학회 논문지 :시스템 및 이론, vol.27, No.3, pp.1384-1391, 2000
  16. 장정환, '(n,k)-스타 그래프의 사이클 특성,' 한국정보처리학회 논문지, Vol.7, No.5, pp.1464-1473, 2000
  17. T. -S. Chen, N. -C. Wang, and C. -P. Chu, 'Path-based multicast communication in wormhole-routed star graph multicomputers,' Proc. of Int'l Conf. on Parol and Distrib. Sys., pp.350-357, 1998 https://doi.org/10.1109/ICPADS.1998.741096
  18. Y. C. Tseng, D. K. Panda, and T. H. Lai, 'A trip-based multicasting model in wormhole-routed networks with virtual channels,' IEEE Trans. on Paral. and Distrib. Sys., Vol.7, No.2, pp.138-150, 1996 https://doi.org/10.1109/71.485503