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


Vol. 15,  No. 4, pp. 189-198, Aug.  2008
10.3745/KIPSTA.2008.15.4.189


PDF
  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.

  Statistics


  Cite this article

[IEEE Style]

J. H. Seo, H. O. Lee, M. S. Jang, "Embedding Mesh-Like Networks into Petersen-Torus(PT) Networks," The KIPS Transactions:PartA, vol. 15, no. 4, pp. 189-198, 2008. DOI: 10.3745/KIPSTA.2008.15.4.189.

[ACM Style]

Jung Hyun Seo, Hyeong Ok Lee, and Moon Suk Jang. 2008. Embedding Mesh-Like Networks into Petersen-Torus(PT) Networks. The KIPS Transactions:PartA, 15, 4, (2008), 189-198. DOI: 10.3745/KIPSTA.2008.15.4.189.