Journal of the Korean Institute of Intelligent Systems (한국지능시스템학회논문지)

Korean Institute of Intelligent Systems (한국지능시스템학회)
권호 표지
DOI QR코드

DOI QR Code

One-to-One Mapping Algorithm between Matrix Star Graphs and Half Pancake Graphs

행렬스타 그래프와 하프 팬케익 그래프 사이의 일대일 사상 알고리즘

  • 김종석 (로체스터대학교 컴퓨터과학과) ;
  • 유남현 (경남대학교 조선해양IT공학과) ;
  • 이형옥 (순천대학교 컴퓨터교육과)
  • Received : 2014.05.02
  • Accepted : 2014.06.30
  • Published : 2014.08.25
Download PDF
⟨ Previous Next ⟩

Abstract

Matrix-star and Half-Pancake graphs are modified versions of Star graphs, and has some good characteristics such as node symmetry and fault tolerance. This paper analyzes embedding between Matrix-star and Half-Pancake graphs. As a result, Matrix-star graphs $MS_{2,n}$ can be embedded into Half-Pancake graphs $HP_{2n}$ with dilation 5 and expansion 1. Also, Half Pancake Graphs, $HP_{2n}$ can be embedded into Matrix Star Graphs, $MS_{2,n}$ with the expansion cost, O(n). This result shows that algorithms developed from Star Graphs can be applied at Half Pancake Graphs with additional constant cost because Star Graphs, $S_n$ is a part graph of Matrix Star Graphs, $MS_{2,n}$.

행렬스타 그래프와 하프팬케익 그래프는 스타 그래프의 변형으로 노드 대칭성과 허용도 등 여러 가지 좋은 성질을 갖는다. 본 연구에서는 행렬스타 그래프와 하프팬케익 그래프 사이의 임베딩을 분석한다. 연구 결과로 행렬스타 그래프 $MS_{2,n}$는 하프팬케익 그래프 $HP_{2n}$에 연장율 5, 확장율 1에 임베딩 가능하다. 또한 하프팬케익 그래프 $HP_{2n}$는 행렬스타 그래프 $MS_{2,n}$에 임베딩하는 연장율 비용이 O(n)임을 보인다. 이러한 결과는 스타 그래프에서 개발된 여러 가지 알고리즘을 하프팬케익 그래프에서 상수의 추가적인 비용으로 시뮬레이션 할 수 있음을 의미한다. 왜냐하면 스타 그래프 $S_n$은 행렬스타 그래프 $MS_{2,n}$의 부분 그래프이기 때문이다.

Keywords

References

  1. F. Harary, J. P. Hayes, and H.-J. Wu, "A Survey of the Theory of Hypercube Graphs," Comput. Math. Appl., vol. 15, pp.277-289, 1988. https://doi.org/10.1016/0898-1221(88)90213-1
  2. Dong, Q., Zhou, J., Fu, Y., & Yang, X., "Embedding a mesh of trees in the crossed cube," Information Processing Letters, vol. 112, pp. 599-603, 2012. https://doi.org/10.1016/j.ipl.2012.04.013
  3. Ivan Stojmenovic, "Honeycomb Networks: Topological Properties and Communication Algorithms," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 10, pp. 1036-1042, 1997. https://doi.org/10.1109/71.629486
  4. S. B. Akers and B. Krishnamurthy, "On Group Graphs and Their Fault Tolerance," IEEE Trans. Comput., vol. c-36, no. 7, pp. 885-888, July 1987. https://doi.org/10.1109/TC.1987.1676983
  5. Kim, J.-S., Eddie Cheng, & Lee, H.-O.,"Embedding hypercubes, rings, and odd graphs into hyper-stars," International Journal of Computer Mathematics, vol. 86, no. 5, pp. 771-778, 2013.
  6. S.K. Yun and K.H. Park, "Hierarchical Cubic Networks", IEEE Trans. Parallel Distributed syst., vol. 9, no. 4, pp. 410-414, 1998. https://doi.org/10.1109/71.667900
  7. D. R. Duh, G. H. Chen and J. F. Fang, "Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Models," IEEE Trans. Parallel Distributed syst., vol. 6, no. 7, pp.714-723, 1995. https://doi.org/10.1109/71.395400
  8. Huang, W.-Y., Liu, J.-J., & Chang, J.-M., "Cycle Embedding in Folded Hypercubes with More Faulty Elements," World Academy of Science, Engineering and Technology, vol. 62, pp. 737-740. 2012.
  9. S. Latifi and Pradip K. Srimani, "Transposition Networks as a Class of Fault-Tolerant Robust Networks," IEEE Trans. Comput., vol. 45, no. 2, pp. 230-238, 1996. https://doi.org/10.1109/12.485375
  10. K. Qiu, H. Meijer and S. G. Akl, "Parallel Routing and Sorting on the Pancake Networks," LNCS, no. 497, pp. 235-242, 1991.
  11. P. Berthome, A. Ferreira and S. Perennes, "Optimal Information Dissemination in Star and Pancake Networks," IEEE Trans. on Parallel and Distributed Syst., vol. 7, no. 12, pp. 1292-1300, 1996. https://doi.org/10.1109/71.553290
  12. Kim, M.-H., Kim, D.-Y., & Lee, H.-O., "Embedding Algorithms for Star, Bubble-Sort. Rotator-Faber-Moore, and Pancake Graphs," LNCS, vol. 6082, pp. 348-357. 2010.
  13. C. H. Yeh and 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
  14. M. M. Azevedo, N. Bagherzadeh, and S. Latifi, "Low Expansion Packing and Embeddings of Hypercubes into Star Graphs: A Performance-Oriented Approach," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 3, pp. 261-274, 1998. https://doi.org/10.1109/71.674318
  15. S. Ranka, J-C. Wang, and N. Yeh, "Embedding Meshes on the Star Graph," J. Parallel and Distributed Computing, vol. 19, pp. 131-135, 1993. https://doi.org/10.1006/jpdc.1993.1098
  16. K. Qiu, S. G. Akl and H. Meuer, "On Some Properties and Algorithms for the Star and Pancake Interconnection Networks," Journal of Parallel and Distributed Computing 22, pp. 16-25, 1994. https://doi.org/10.1006/jpdc.1994.1066
  17. Hyeongok Lee and Hyeongseok Lim, , "Matrix-Star Graphs: A New Interconnection Network based on Matrix Operations," Journal of KIISE: Computer Systems and Theory, vol. 26, no. 4, pp. 389-405, 1999.
  18. JuBong Kim, "Design and Analyzation of Half Pancake Graphs," Master Thesis, Sunchon National University, 2014.
  19. R. Kabakas, Inho N., "Message Delivery and Energy Consumption Analysis on Pocket Switched Network Routing Protocols," Journal of Korean Institute of Intelligent Systems, vol. 23, no. 6, pp. 571-576, 2013. https://doi.org/10.5391/JKIIS.2013.23.6.571
  20. Jungjun Kim, "ECG Signal Compression based on Adaptive Multi-level Code," Journal of Korean Institute of Intelligent Systems, vol. 23, no. 6, pp. 519-526, 2013. https://doi.org/10.5391/JKIIS.2013.23.6.519