The KIPS Transactions:PartA (정보처리학회논문지A)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Embedding Mesh-Like Networks into Petersen-Torus(PT) Networks

메쉬 부류 네트워크를 피터슨-토러스(PT) 네트워크에 임베딩

  • 서정현 (순천대학교 컴퓨터과학과) ;
  • 이형옥 (순천대학교 컴퓨터교육과) ;
  • 장문석 (순천대학교 공과대학 컴퓨터공학과)
  • Published : 2008.08.29
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we prove mesh-like networks can be embedded into Petersen-Torus(PT) networks. Once interconnection network G is embedded in H, the parallel algorithm designed in Gcan be applied to interconnection network H. The torus is embedded into PT with dilation 5, link congestion 5 and expansion 1 using one-to-one embedding. The honeycomb mesh is embedded into PT with dilation 5, link congestion 2 and expansion 5/3 using one-to-one embedding. Additional, We derive average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus and honeycomb mesh networks into PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one.

본 논문은 분지수가 상수인 네트워크들을 피터슨-토러스(PT) 네트워크에 임베딩 가능함을 보인다. 상호연결망 G가 H에 임베딩 되면 G에서 설계된 병렬 알고리즘을 상호연결망 H에 적용할 수 있다. 토러스(메쉬)를 PT에 연장율 5, 밀집율 5 그리고 확장율 1에 일대일 임베딩 하였고, 허니컴브 메쉬를 PT에 연장율 5, 밀집율 2 그리고 확장율 5/3에 일대일 임베딩 하였다. 추가로 평균 연장율을 분석하였다. 널리 알려진 토러스 와 허니컴브 메쉬 네트워크를 연장율과 밀집율을 5이하에 PT에 임베딩 함으로써 웜홀 라우팅 방식과 store-and-forward 방식 모두에서 임베딩 알고리즘이 사용 가능하고, 일대일 임베딩을 함으로써 시뮬레이션시 프로세서 작업 처리량을 최소화 하였다.

Keywords

References

  1. S. Bettayeb and B. Cong and M. Girou and I. H. Sudborough, “Embedding Star Networks into Hypercubes,” IEEE trans. comput., Vol.45, No.2, pp.186-194, Feb., 1996 https://doi.org/10.1109/12.485371
  2. M. Hamdi and S. W. Song, “Embedding Hierarchical Hypercube Networks into the Hypercube,” IEEE trans. on Parallel and Distributed Systems, Vol.8, No.9, pp.987-902, Sep., 1997 https://doi.org/10.1109/71.615435
  3. X. Shen and W. Liang and Q. Hu, “On Embedding Between 2D Meshes of the Same Size,” IEEE trans. comput., Vol.46, No.8, pp.880-889, Aug., 1997 https://doi.org/10.1109/12.609277
  4. I. Stojmenovic, “Honeycomb Network: Topological Properties and Commnication Algorithms,” IEEE trans. on Parallel and Distributed Systems, Vol.8, No.10, pp.1036-1042, Oct., 1997 https://doi.org/10.1109/71.629486
  5. S. K. Das and A. K. Banerjee “Embeddings into Hyper Petersen networks: yet another hypercube-like interconnection Topology,” VLSI Design, Vol.2, No.4, pp.335-351, 1995 https://doi.org/10.1155/1995/95759
  6. C. H Kim, J. Choi and H.S. Lim, “Embedding Full Ternary Trees into Recursive Circulants,” EurAsia-ICT2002, LNCS 2510, pp.874-882, 2002
  7. S. Y. Hsieh, “Embedding of Cycles in the Faulty Hypercube,” ACSAC2005, LNCS 3740, pp229-235, 2005 https://doi.org/10.1007/11572961_19
  8. S. Y. Hsieh, G. H. Chen and C. W. Ho, “Embed longest rings onto star graphs with vertex fault,” Proceedings of the International Conference on Parallel Processing, 1998, pp.140-147, 1998
  9. P. F. Cortese and G. D. Battista, “On Embedding a Cycle in a Plane Graph,” GD2005, LNCS 3843, pp.49-60, 2005 https://doi.org/10.1007/11618058_5
  10. S. Bezrukov, “Embedding complete trees into the Hypercube,” Discrete Applied Mathematics, Vol.100, No.2-3, pp.101-119, 2001 https://doi.org/10.1016/S0166-218X(00)00256-0
  11. J. H. Park, H. S. Lim and H. C. Kim, “Embedding Starlike Trees into Hypercube-Like Interconnection Networks,” ISPA 2006 Ws, LNCS 4331, pp.301-310, 2006 https://doi.org/10.1007/11942634_32
  12. K. Li, “On the Performance of Randomized Embedding of Reproduction Trees in Static Networks,” International Journal of Parallel Programming, Vol.31, No.5, pp.393-406, Oct., 2003 https://doi.org/10.1023/A:1027336712552
  13. K. Li, “Comparative Performance Evaluation of a Random-Walk-Based Algorithm for Embedding Dynamically Evolving Trees in Hypercubic Networks,” Computation and Concurrency:Practice and Experience, Vol.15, 2003
  14. D. K. Saikia, R. Badrinath and R. K. Sen, “Embedding Torus on the Star Graph,” IEEE Transactions on Parallel and Distributed Systems, Vol.9, No.7, pp.650-663, JULY 1998 https://doi.org/10.1109/71.707542
  15. Z. Miller, D. Pritikin, I.H. Sudborough, “Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group,” IEEE Transactions on Computers, Vol.43, No.1, pp.13-22, Jan., 1994 https://doi.org/10.1109/12.250605
  16. M. Y. Chan, F. Y. L. Chin, “On Embedding Rectangular Grids in Hypercubes,” IEEE Transactions on Computers, Vol.37, No.10, pp.1285-1288, Oct., 1988 https://doi.org/10.1109/12.5991
  17. K. W. Tang and S. A. Padubidri, “Diagonal and toroidal Mesh Networks,” IEEE trans. comput., Vol.43, No.7 pp.815-826, Jul., 1994 https://doi.org/10.1109/12.293260
  18. J. A. Ellis, “Embedding Rectangular Grids into Square Grids,” IEEE Transactions on Computers, Vol.40, No.1, pp.46-52, Jan., 1991 https://doi.org/10.1109/12.67319
  19. J. A. Ellis, “Embedding grids into grids: techniques for large compression ratios,” Networks, Vol.27, pp.1-17, 1996 https://doi.org/10.1002/(SICI)1097-0037(199601)27:1<1::AID-NET1>3.0.CO;2-Q
  20. S. H. S. Huang, H. Liu, and R. M. Verma, “On embedding rectangular meshes into rectangular meshes of smaller aspect ratio,” Information Processing Letters, 63, pp.123-129, 1997 https://doi.org/10.1016/S0020-0190(97)00114-2
  21. S. Y. Kim, J. Hur, “An Approach for Torus Embedding,” proc of international conference on parallel processing, pp.301-306, Sep., 1999
  22. X. Yang, Y.Y. Tang, J. Cao, “Embedding torus in hexagonal honeycomb torus,” IET Computers & Digital Techniques, Vol.2, pp.86-93, Mar., 2008 https://doi.org/10.1049/iet-cdt:20050219
  23. 서정현, 이형옥, 장문석, “멀티컴퓨팅 시스템을 위한 피터슨-토러스(PT) 네트워크”, 정보과학회 논문지 제35권 6호, 2008년 6월