DOI QR코드

DOI QR Code

An Algorithm for One-to-One Mapping Matrix-star Graph into Transposition Graph

행렬-스타 그래프를 전위 그래프에 일-대-일 사상하는 알고리즘

  • Kim, Jong-Seok (Department of Computer Science, University of Rochester) ;
  • Lee, Hyeong-Ok (Department of Computer Education, Sunchon National University)
  • Received : 2014.03.21
  • Accepted : 2014.04.21
  • Published : 2014.05.31

Abstract

The matrix-star and the transposition graphs are considered as star graph variants that have various merits in graph theory such as node symmetry, fault tolerance, recursive scalability, etc. This paper describes an one-to-one mapping algorithm from a matrix-star graph to a transposition graph using adjacent properties in graph theory. The result show that a matrix-star graph $MS_{2,n}$ can be embedded in a transposition graph $T_{2n}$ with dilation n or less and average dilation 2 or less.

행렬-스타 그래프와 전위 그래프는 스타 그래프 부류로 그래프 이론 관점에서 노드 대칭성, 고장 허용도, 재귀적 확장성 등 스타그래프의 장점을 가지고 있는 상호연결망이다. 본 논문에서는 그래프 이론의 인접 성질을 이용하여 행렬-스타 그래프와 전위 그래프 사이의 일-대-일 사상 알고리즘을 제안한다. 행렬-스타 그래프가 전위 그래프에 연장율 n 이하에 사상할 수 있음을 보이며, 평균 연장율이 2 이하임을 보인다.

Keywords

References

  1. M. Kim, D.-W. Kim, and H.-O. Lee, "Embedding Algorithms for Star, Bubble-Sort, Rotator-Faber-Moore, and Pancake Graphs," in Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing, pp. 348-357, 2010.
  2. S. Latifi, P. K. Srimani, "Transposition Networks as a Class of Fault-Tolerant Robust Networks," IEEE Trans. Computers, vol. 45, no. 2, pp. 230-238, 1996. https://doi.org/10.1109/12.485375
  3. S. Ranka, J. Wang, and N. Yeh, "Embedding Meshes on the Star Graph," Journal of Parallel and Distributed Computing, vol. 19, pp. 131-135, 1993. https://doi.org/10.1006/jpdc.1993.1098
  4. S. B. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the n-Cube," in Proceedings of the International Conference on Parallel Processing, pp. 393-400, 1987.
  5. H.-O. Lee, J.-S. Kim, K.-W. Park, J.-H. Seo, and E. Oh, "Matrix-Star Graphs: A New Interconnection Network Based on Matrix Operations," in Proceedings of the International Conference on Asia-Pacific Computer Systems Architecture, pp. 478-487, 2005.
  6. C. H. Yeh, E. A. Varvarigos, "Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 9, No. 10, pp. 987-1003, 1998. https://doi.org/10.1109/71.730528
  7. Z. T. Chou, C. C. Hsu, and J. P. Sheu, "Bubblesort Star graphs: A New Interconnection Network," in Proceedings of the 9th International conference on Parallel and Distributed Systems, pp. 41-48, 1996.
  8. H.-O. Lee, H. Sim, J.-H. Seo, and M. Kim, "Embedding Algorithms for Bubble-Sort, Macro-Star, and Transposition Graphs," in Proceedings of the 2010 IFIP international conference on Network and parallel computing, pp. 134-143, 2010.
  9. A. Y. Wu, "Embedding of Tree Networks into Hypercubes," Journal of Parallel and Distributed Computing, vol. 2, pp. 238-249, 1985. https://doi.org/10.1016/0743-7315(85)90026-7
  10. W. Deng, Q. Luo, "Embedding Complete Binary Trees into Locally Twisted Cubes," Advanced Engineering Forum, vol. 6-7, pp. 70-75, 2012. https://doi.org/10.4028/www.scientific.net/AEF.6-7.70
  11. J.-S. Kim, M. Kim, H. Sim, and H.-O. Lee, "Embedding Algorithms for Bubble-Sort, Pancake, and Matrix-Star Graphs," Communications in Computer and Information Science, vol. 150, pp. 243-252, 2011. https://doi.org/10.1007/978-3-642-20975-8_27