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

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

다중 메쉬의 꼬인 큐브에 대한 임베딩

Embedding Multiple Meshes into a Twisted Cube

  • 김숙연 (한경대학교 컴퓨터공학과)
  • 투고 : 2008.12.04
  • 심사 : 2009.05.03
  • 발행 : 2010.04.15
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

꼬인 큐브는 병렬처리 시스템의 상호연결망으로서 널리 알려진 하이퍼큐브와 많은 면에서 비슷하면서도 절반 정도의 지름을 가지는 등 개선된 망 성질들을 가지므로 각광받아 왔다. 본 논문에서는 크기 $2^n{\times}2^m$인 메쉬의 복사본 $2^{n-1}$개가 꼬인 큐브에 노드 중복없이 연장율 1로 임베딩될 수 있음을 보인다($1{\leq}n{\leq}m$). 여기서 확장율은 m이 짝수이면 1이고 홀수이면 2이다.

The twisted cube has received great attention because it has several superior properties to the hypercube that is widely known as a versatile parallel processing system. In this paper, we show that node-disjoint $2^{n-1}$ meshes of size $2^n{\times}2^m$ can be embedded into a twisted cube with dilation 1 where $1{\leq}n{\leq}m$. The expansion is 1 for even m and 2 for odd m.

키워드

참고문헌

  1. B. Monien, H. Sudborough, "Embedding one interconnection network in another," pp.257-282, Springer-Verlag/Wien, 1990. Computing Supplementum 7: Computational Graph Theory.
  2. A. Rosenberg, "Issues in the study of graph embeddings," Lecture Notes in Computer Science, Springer-Verlag, New York, vol.100, pp.150-176, 1981.
  3. F. Berman, L. Snyder, "On mapping parallel algorithms into parallel architectures," J. Parallel Distrib. Comput., vol.4, no.5, pp.439-458, 1987. https://doi.org/10.1016/0743-7315(87)90018-9
  4. V. Chaudhary, J.K. Aggarwal, "Generalized mapping of parallel algorithms onto parallel architectures," Proc. Int'l Conf. Parallel Processing, pp. 137-141, Aug. 1990.
  5. S. L. Bezrukov, J. D. Chavez, L. H. Harper M. Rottger, U.-P. Schroeder, "The congestion of n-cube layout on a rectangular grid," Discrete Math., vol.213, no.1-3, pp.13-19, Feb. 2000. https://doi.org/10.1016/S0012-365X(99)00162-4
  6. A. Matsubayashi, "VLSI layout of trees into grids of minimum width," IEICE Trans. Fundamentals, vol.E87-A, no.5, pp.1059-1069, May 2004.
  7. A. Patel, A. Kusalik, C. McCrosky, "Area-efficient VLSI layouts for binary hypercubes," IEEE Trans. Computers, vol.49, no.2, pp.160-169, Feb. 2000. https://doi.org/10.1109/12.833112
  8. Q. Dong, X. Yang, J. Zhao and Y. Y. Tang, "Embedding a family of disjoint 3D meshes into a crossed cube," Information Sciences, vol.178, Issue 11, pp.2396-2405, June 2008. https://doi.org/10.1016/j.ins.2007.12.010
  9. C.-J. Lai, C.-H. Tsai, "Embedding a family of meshes into twisted cubes," Information Processing Letters, vol.108, Issue 5, pp.326-330, Nov. 2008. https://doi.org/10.1016/j.ipl.2008.06.005
  10. P. A. J. Hilbers, M. R. J. Koopman, J. L. A. van de Snepscheut, "The twisted cube," in PARLE: Parallel Architectures and Languages Europe, Parallel Architectures, vol.1, Springer, Berlin, pp.152- 158, 1987.
  11. S. Abraham, K. Padmanabhan, "The twisted cube topology for multiprocessors: a study in network asymmetry," J. Parallel Distrib. Comput., vol.13, Issue 1, pp.104-110, 1991. https://doi.org/10.1016/0743-7315(91)90113-N
  12. C.-P. Chang, J.-N. Wang, L.-H. Hsu, "Topological properties of twisted cube," Information Sciences, vol.113, pp.147-167, 1999. https://doi.org/10.1016/S0020-0255(98)10045-2
  13. E. Abuelrub, S. Bettayeb, "Embedding complete binary trees into twisted hypercubes," Proc. of the Int. Conf. on Computer Applications in Design, Simulation and Analysis, Washington, D.C. March 10-12, pp.1-4, 1992.
  14. J. Fan, X. Lin, X. Jia, R. W. H. Lau, "Edgepancyclicity of twisted cubes," ISAAC 2005, Lecture Notes in Comput. Sci., vol.3827, pp.1090- 1099, 2005.
  15. W.-T. Huang, J. J. M. Tan, C.-N. Hung, L.-H. Hsu, "Fault-tolerant hamiltonicity of twisted cubes," J. Parallel Distrib. Comput., vol.62, no.4, pp.591-604, 2002. https://doi.org/10.1006/jpdc.2001.1813
  16. M.-C. Yang, T.-K. Li, J. J. M. Tan, L.-H. Hsu, "On embedding cycles into faulty twisted cubes," Information Sciences, vol.176, no.6, pp.676-690, 2006. https://doi.org/10.1016/j.ins.2005.04.004
  17. J.-S. Fu, "Fault-free Hamiltonian cycles in twisted cubes with conditional link faults," Theoretical Computer Science, vol.407, no.1-3, pp.318-329, Nov. 2008. https://doi.org/10.1016/j.tcs.2008.06.024
  18. J. Fan, X. Lin, Y. Pan, X. Jia, "Optimal faulttolerant embedding of paths in twisted cubes," J. Parallel Distrib. Comput., vol.67, no.2, pp.205-214, 2007. https://doi.org/10.1016/j.jpdc.2006.04.004
  19. J. Fan, X. Lin, "The t/k-diagnosability of the BC Graphs," IEEE Trans. Computers, vol.54, no.2, pp.176-184, 2005. https://doi.org/10.1109/TC.2005.33
  20. S.-Y. Kim, "Embedding a mesh of size $2^{n}$${\times}$$2^{m}$ into a twisted cube," The Transactions of the Korea Information Processing Society A, vol.16-A, no.4, pp.223-226, 2009. https://doi.org/10.3745/KIPSTA.2009.16-A.4.223