Node Mapping Algorithm between Torus and Petersen-Torus Networks

In this paper, it was proven that Torus T(5m,2n) might be embedded into Petersen-Torus PT(m,n) at dilation 5, congestion 5, and expansion 1. It was also proven that Torus might be embedded in PT at 3 or less of average dilation. The embedding algorithm could be available in both wormhole routing sys...

Full description

Saved in:
Bibliographic Details
Main Authors: Jung-hyun Seo, HyeongOk Lee, Moon-Suk Jang, Soon-Hee Han
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Computers
Embedding
Hypercubes
Interconnection Network
Joining processes
Multiprocessor interconnection
Parallel algorithms
Petersen-Torus
Routing
Torus
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, it was proven that Torus T(5m,2n) might be embedded into Petersen-Torus PT(m,n) at dilation 5, congestion 5, and expansion 1. It was also proven that Torus might be embedded in PT at 3 or less of 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 network in PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one embedding.
DOI:10.1109/NCM.2008.50