Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2008.15-A.4.189

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

Seo, Jung-Hyun (순천대학교 컴퓨터과학과)
Lee, Hyeong-Ok (순천대학교 컴퓨터교육과)
Jang, Moon-Suk (순천대학교 공과대학 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartA / v.15A, no.4, 2008 , pp. 189-198 More about this Journal
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.
Keywords
Interconnection Network; Petersen-torus; Embedding; Mesh; Torus; Honeycomb Mesh;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 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   DOI   ScienceOn
2 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
3 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   DOI   ScienceOn
4 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   DOI   ScienceOn
5 K. W. Tang and S. A. Padubidri, “Diagonal and toroidal Mesh Networks,” IEEE trans. comput., Vol.43, No.7 pp.815-826, Jul., 1994   DOI   ScienceOn
6 J. A. Ellis, “Embedding Rectangular Grids into Square Grids,” IEEE Transactions on Computers, Vol.40, No.1, pp.46-52, Jan., 1991   DOI   ScienceOn
7 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   DOI   ScienceOn
8 S. Y. Kim, J. Hur, “An Approach for Torus Embedding,” proc of international conference on parallel processing, pp.301-306, Sep., 1999
9 서정현, 이형옥, 장문석, “멀티컴퓨팅 시스템을 위한 피터슨-토러스(PT) 네트워크”, 정보과학회 논문지 제35권 6호, 2008년 6월   과학기술학회마을
10 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   DOI   ScienceOn
11 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   DOI   ScienceOn
12 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   DOI
13 C. H Kim, J. Choi and H.S. Lim, “Embedding Full Ternary Trees into Recursive Circulants,” EurAsia-ICT2002, LNCS 2510, pp.874-882, 2002
14 S. Y. Hsieh, “Embedding of Cycles in the Faulty Hypercube,” ACSAC2005, LNCS 3740, pp229-235, 2005   DOI   ScienceOn
15 P. F. Cortese and G. D. Battista, “On Embedding a Cycle in a Plane Graph,” GD2005, LNCS 3843, pp.49-60, 2005   DOI   ScienceOn
16 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   DOI
17 S. Bezrukov, “Embedding complete trees into the Hypercube,” Discrete Applied Mathematics, Vol.100, No.2-3, pp.101-119, 2001   DOI   ScienceOn
18 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   DOI   ScienceOn
19 J. A. Ellis, “Embedding grids into grids: techniques for large compression ratios,” Networks, Vol.27, pp.1-17, 1996   DOI
20 X. Yang, Y.Y. Tang, J. Cao, “Embedding torus in hexagonal honeycomb torus,” IET Computers & Digital Techniques, Vol.2, pp.86-93, Mar., 2008   DOI   ScienceOn
21 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   DOI   ScienceOn
22 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
23 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   DOI   ScienceOn